Sciweavers

1456 search results - page 41 / 292
» An Overview of the SODA System
Sort
View
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
13 years 9 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
SODA
2004
ACM
83views Algorithms» more  SODA 2004»
13 years 9 months ago
Caching queues in memory buffers
Motivated by the need for maintaining multiple, large queues of data in modern high-performance systems, we study the problem of caching queues in memory under the following simpl...
Rajeev Motwani, Dilys Thomas
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 9 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
13 years 9 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...