95 search results - page 17 / 19 » CORR 2012 |
117
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
162
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
152
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
122
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
123
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...