2434 search results - page 360 / 487 » Algorithmic Randomness of Closed Sets |
184
Voted
STOC
1998
ACM
15 years 7 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
141
Voted
CP
1997
Springer
15 years 7 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
119
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
113
Voted
STOC
1995
ACM
15 years 7 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
173
click to vote
CDC
2008
IEEE
15 years 3 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...