Sciweavers

2252 search results - page 233 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 9 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
DC
2007
15 years 3 months ago
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
Josef Widder, Ulrich Schmid
PODC
2010
ACM
15 years 7 months ago
Optimal gradient clock synchronization in dynamic networks
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rote...
JSAC
2006
96views more  JSAC 2006»
15 years 3 months ago
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
PE
2002
Springer
158views Optimization» more  PE 2002»
15 years 3 months ago
Comparison of inter-area rekeying algorithms for secure wireless group communications
Many emerging mobile wireless applications depend upon secure group communications, in which data is encrypted and the group's data encryption key is changed whenever a membe...
Chun Zhang, Brian DeCleene, James F. Kurose, Donal...