Sciweavers

194 search results - page 37 / 39
» Computing Roundness is Easy if the Set is Almost Round
Sort
View
ICNP
2002
IEEE
13 years 10 months ago
Using Adaptive Rate Estimation to Provide Enhanced and Robust Transport over Heterogeneous Networks
The rapid advancement in wireless communication technology has spurred significant interest in the design and development of enhanced TCP protocols. Among them, TCP Westwood (TCPW...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Mario Ger...
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
13 years 10 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
CCS
2008
ACM
13 years 7 months ago
Securing group key exchange against strong corruptions
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
Emmanuel Bresson, Mark Manulis
MOBICOM
2010
ACM
13 years 6 months ago
SMS-based web search for low-end mobile devices
Short Messaging Service (SMS) based mobile information services have become increasingly common around the world, especially in emerging regions among users with low-end mobile de...
Jay Chen, Lakshminarayanan Subramanian, Eric A. Br...
TCOM
2010
91views more  TCOM 2010»
13 years 4 months ago
Slot-wise maximum likelihood estimation of the tag population size in FSA protocols
Abstract—Framed Slotted Aloha (FSA) is a popular anticollision technique in state-of-the-art RF-ID systems, as in ISO/IEC CD 18000-6 for 900MHz or the EPCglobal HF Gen 2 draft fo...
Bastian Knerr, Martin Holzer 0002, Christoph Anger...