154 search results - page 14 / 31 » algorithmica 2007 |
ALGORITHMICA
2005
14 years 11 months ago
2005
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 ...
78
Voted
ALGORITHMICA
2005
14 years 11 months ago
2005
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
ALGORITHMICA
2005
14 years 11 months ago
2005
We consider the setting of a web server that receives requests for documents from clients, and returns the requested documents over a multicast/broadcast channel. We compare the q...
74
Voted
ALGORITHMICA
2004
14 years 11 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
67
Voted
ALGORITHMICA
2004
14 years 11 months ago
2004
Abstract. We present an O(n log n)-time algorithm to solve the threedimensional layers-of-maxima problem, an improvement over the prior O(n log n log log n)-time solution. A previo...