453 search results - page 84 / 91 » Tight bounds for the partial-sums problem |
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing...
DIALM
2003
ACM
14 years 19 days ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...
DAM
2007
13 years 7 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...