352 search results - page 8 / 71 » A local search approximation algorithm for k-means clusterin... |
89
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
DEXA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
WEBDB
2007
Springer
15 years 3 months ago
2007
Springer
Due to resource constraints, search engines usually have difficulties keeping the local database completely synchronized with the Web. To detect as many changes as possible, the ...