458 search results - page 2 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
PR
2007
13 years 4 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
MLDM
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
This paper demonstrates the applicability of the recently proposed supervised dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial locali...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...