Sciweavers

112 search results - page 13 / 23
» A Ramsey-type result for the hypercube
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 4 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
PODS
2004
ACM
96views Database» more  PODS 2004»
14 years 7 months ago
Roads, Codes and Spatiotemporal Queries
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...
IPPS
2009
IEEE
14 years 2 months ago
On the tradeoff between playback delay and buffer space in streaming
We consider the following basic question: a source node wishes to stream an ordered sequence of packets to a collection of receivers, which are distributed among a number of clust...
Alix L. H. Chow, Leana Golubchik, Samir Khuller, Y...
IPPS
2006
IEEE
14 years 1 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch