21 search results - page 2 / 5 » algorithmica 2005 |
ALGORITHMICA
2005
13 years 5 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...
ALGORITHMICA
2005
13 years 5 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 ...
ALGORITHMICA
2005
13 years 5 months ago
2005
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
ALGORITHMICA
2005
13 years 5 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
13 years 5 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...