Sciweavers

340 search results - page 12 / 68
» Clustering with Lower Bound on Similarity
Sort
View
ICIP
2007
IEEE
15 years 3 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
SIROCCO
2008
14 years 11 months ago
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
14 years 9 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
ALT
2009
Springer
15 years 6 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...
ICALP
2009
Springer
15 years 9 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson