5115 search results - page 505 / 1023 » On Randomized Lanczos Algorithms |
192
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
211
click to vote
JSAC
2008
15 years 6 months ago
2008
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...
203
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
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...
177
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
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 ...
174
click to vote
FOCS
2006
IEEE
16 years 28 days ago
2006
IEEE
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...