Sciweavers

1871 search results - page 328 / 375
» The Ephemeral Pairing Problem
Sort
View
PODC
2005
ACM
15 years 12 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 12 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
15 years 12 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay
ICALP
2005
Springer
15 years 12 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
LOCA
2005
Springer
15 years 12 months ago
The GETA Sandals: A Footprint Location Tracking System
This paper presents the design, implementation, and evaluation of a footprintbased indoor location system on traditional Japanese GETA sandals. Our footprint location system can s...
Kenji Okuda, Shun-yuan Yeh, Chon-in Wu, Keng-hao C...