5595 search results - page 13 / 1119 » Approximation Algorithms for Clustering Problems |
SDM
2009
SIAM
15 years 8 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
150
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ICMLA
2008
15 years 1 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
STOC
2007
ACM
15 years 12 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
ASPDAC
1999
ACM
15 years 4 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...