Sciweavers

3415 search results - page 536 / 683
» Lower Bounds for Kernelizations
Sort
View
VLDB
2007
ACM
119views Database» more  VLDB 2007»
15 years 10 months ago
Integrity Auditing of Outsourced Data
An increasing number of enterprises outsource their IT services to third parties who can offer these services for a much lower cost due to economy of scale. Quality of service is ...
Min Xie, Haixun Wang, Jian Yin, Xiaofeng Meng
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
15 years 10 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
15 years 10 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
GLOBECOM
2006
IEEE
15 years 10 months ago
Further Analysis of XCP Equilibrium Performance
— Low analyzes the equilibrium performance of the recently developed eXplicit Control Protocol (XCP) by applying the derived window-based dynamical model. However, Low’s window...
Peng Wang, David L. Mills
ICDCS
2006
IEEE
15 years 10 months ago
Routing in Networks with Low Doubling Dimension
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg,...