Sciweavers

1068 search results - page 28 / 214
» On Space Bounded Server Algorithms
Sort
View
DCOSS
2009
Springer
15 years 2 months ago
Local Construction of Spanners in the 3-D Space
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
Iyad A. Kanj, Ge Xia, Fenghui Zhang
111
Voted
JPDC
2007
184views more  JPDC 2007»
14 years 9 months ago
Modeling of concurrent web sessions with bounded inconsistency in shared data
Client interactions with modern web-accessible network services are typically organized into sessions involving multiple requests that read and write shared application data. Ther...
Alexander Totok, Vijay Karamcheti
91
Voted
UAI
2004
14 years 11 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
LCTRTS
2005
Springer
15 years 3 months ago
Upper bound for defragmenting buddy heaps
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...
Delvin C. Defoe, Sharath R. Cholleti, Ron Cytron
FOCS
2008
IEEE
15 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder