18 search results - page 3 / 4 » On Approximating Node-Disjoint Paths in Grids |
182
click to vote
JMLR
2010
15 years 21 days ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
142
click to vote
CMPB
2010
15 years 6 months ago
2010
We demonstrate the use of highly parallel graphics processing units (GPUs) to accelerate the Superposition/Convolution (S/C) algorithm to interactive rates while reducing the numbe...
135
click to vote
COCOON
2007
Springer
16 years 3 days ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
156
click to vote
IROS
2008
IEEE
16 years 10 days ago
2008
IEEE
— Legged robots require accurate models of their environment in order to plan and execute paths. We present a probabilistic technique based on Gaussian processes that allows terr...
161
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— In this paper we investigate the use of proactive multipath routing to achieve energy efficient operation of ad hoc wireless networks. The focus is on optimizing trade-offs be...