233 search results - page 13 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
CCR
2008
13 years 7 months ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
ICPP
2003
IEEE
14 years 1 months ago
2003
IEEE
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such...
SIAMCOMP
2008
13 years 7 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...