Sciweavers

2252 search results - page 206 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
127
Voted
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 9 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
129
Voted
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
15 years 9 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
125
Voted
IWQOS
2004
Springer
15 years 9 months ago
Towards content distribution networks with latency guarantees
This paper investigates the performance of a content distribution network designed to provide bounded content access latency. Content can be divided into multiple classes with dif...
Chengdu Huang, Tarek F. Abdelzaher
144
Voted
DCOSS
2006
Springer
15 years 7 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
99
Voted
WDAG
2009
Springer
91views Algorithms» more  WDAG 2009»
15 years 10 months ago
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...