Journal of the ACM
SCOPUS (1954-2023)SCIE-ISI
0004-5411
1557-735X
Mỹ
Cơ quản chủ quản: Association for Computing Machinery (ACM) , ASSOC COMPUTING MACHINERY
Lĩnh vực:
SoftwareArtificial IntelligenceInformation SystemsHardware and ArchitectureControl and Systems Engineering
Các bài báo tiêu biểu
Authoritative sources in a hyperlinked environmentThe network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of context on the World ... ... hiện toàn bộ
Tập 46 Số 5 - Trang 604-632 - 1999
Robust principal component analysis?
This article is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components
exactly
by solvin... ... hiện toàn bộ
Tập 58 Số 3 - Trang 1-37 - 2011
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Tập 42 Số 6 - Trang 1115-1145 - 1995
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Tập 22 Số 2 - Trang 248-260 - 1975
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Tập 19 Số 2 - Trang 248-264 - 1972
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Consider a set of
S
of
n
data points in real
d
-dimensional space, R
d
, where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess
... ... hiện toàn bộ
Tập 45 Số 6 - Trang 891-923 - 1998
An Algorithm for Subgraph IsomorphismSubgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments h... ... hiện toàn bộ
Tập 23 Số 1 - Trang 31-42 - 1976
A New Method of Interpolation and Smooth Curve Fitting Based on Local ProceduresA new mathematical method is developed for interpolation from a given set of data points in a plane and for fitting a smooth curve to the points. This method is devised in such a way that the resultant curve will pass through the given points and will appear smooth and natural. It is based on a piecewise function composed of a set of polynomials, each of degree three, at most, and applicab... ... hiện toàn bộ
Tập 17 Số 4 - Trang 589-602 - 1970
Integer Programming Formulation of Traveling Salesman Problems
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems in integer programming, that is, linear programming problems in which some or all of the variables are required to assume integral values. This fact is rendered quite interesting by recent research on such problems, notably by R. E. Gomory [2, 3], whi... ... hiện toàn bộ
Tập 7 Số 4 - Trang 326-329 - 1960