5115 search results - page 6 / 1023 » On Randomized Lanczos Algorithms |
TMC
2012
11 years 9 months ago
2012
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
EUROCRYPT
2012
Springer
11 years 9 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
SDM
2012
SIAM
11 years 9 months ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...