Sciweavers

5138 search results - page 534 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
JSAC
2008
111views more  JSAC 2008»
15 years 7 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 5 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 7 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
FOCS
2006
IEEE
16 years 1 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
16 years 13 days ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith