Sciweavers

2947 search results - page 443 / 590
» The timely token protocol
Sort
View
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 10 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
CCS
2008
ACM
15 years 8 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
CONEXT
2005
ACM
15 years 8 months ago
Root cause analysis for long-lived TCP connections
While the applications using the Internet have changed over time, TCP is still the dominating transport protocol that carries over 90% of the total traffic. Throughput is the key...
Matti Siekkinen, Guillaume Urvoy-Keller, Ernst W. ...
CORR
2010
Springer
133views Education» more  CORR 2010»
15 years 6 months ago
Performance evaluation of a new route optimization technique for mobile IP
Mobile ip (mip) is an internet protocol that allows mobile nodes to have continuous network connectivity to the internet without changing their ip addresses while moving to other ...
Moheb R. Girgis, Tarek M. Mahmoud, Youssef S. Takr...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn