135 search results - page 3 / 27 » Approximability Distance in the Space of H-Colourability Pro... |
STOC
1998
ACM
13 years 9 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...
SIAMCOMP
2010
13 years 3 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
— A main difficulty for orbit determination of space debris is the correlation of tracks of data belonging to the same physical object. A sequence of optical measurements of an ...
JCSS
2002
13 years 5 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...