1100 search results - page 167 / 220 » Approximate distance oracles |
108
click to vote
FOCS
2010
IEEE
14 years 8 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
APPROX
2011
Springer
13 years 10 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
119
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper we present a novel face classification system
where we represent face images as a spatial arrangement
of image patches, and seek a smooth non-linear functional
map...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
103
click to vote
PODS
2004
ACM
15 years 10 months ago
2004
ACM
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...