847 search results - page 63 / 170 » Approximation algorithms for projective clustering |
104
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
138
Voted
STOC
2002
ACM
16 years 28 days ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
94
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
114
Voted
GRAPHITE
2005
ACM
15 years 6 months ago
2005
ACM
Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create ...
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...