Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

STOC
1999
ACM

74views Algorithms» more STOC 1999»

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces

15 years 7 months ago

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces

Download www.cs.ucla.edu

Allan Borodin, Rafail Ostrovsky, Yuval Rabani

Real-time Traffic

Algorithms | STOC 1999 |

claim paper

Related Content

» Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order

» Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms

» Coresets and Sketches for High Dimensional Subspace Approximation Problems

» Clustering high dimensional data using subspace and projected clustering algorithms

» Optimal GridClustering Towards Breaking the Curse of Dimensionality in HighDimensional Clu...

» Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

» DensityConnected Subspace Clustering for HighDimensional Data

» HighDimensional Similarity Search Using DataSensitive Space Partitioning

» Vector Approximation based Indexing for Nonuniform High Dimensional Data Sets

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	STOC
Authors	Allan Borodin, Rafail Ostrovsky, Yuval Rabani

Comments (0)