Clustering motion

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 84-93

  Har Peled, S ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; PROBLEM SOLVING; SET THEORY;

STATIC CLUSTERING;

COMPUTATION THEORY;

EID: 0035165992     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959883     Document Type: Conference Paper

References (20)

1. Indexing moving points
2. Maintaining the approximate extent measures of moving points
3. Approximation algorithms for projective clustering
4. Testing of clustering
5. Approximation algorithms for geometric problems
6. A decomposition of multidimensional point sets with applications to kappa;-nearest-neighbors and n-body potential fields
7. Incremental clustering and dynamic information retrieval
8. Optimal algorithms for approximate clustering
9. Clustering to minimize the maximum intercluster distance
10. Clustering motion
11. Approximate shape fitting via linearization
12. Epsilon-nets and simplex range queries
13. Sublinear time algorithms for metric space problems
14. Approximate nearest neighbors: Towards removing the curse of dimensionality
15. On the complexity of locating linear facilities in the plane
16. Sublinear time approximate clustering
17. On the uniform convergence of relative frequencies of events to their probabilities