2944 search results - page 345 / 589 » Improving Bound Propagation |
133
click to vote
SWAT
1990
Springer
15 years 10 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
145
click to vote
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose a linear predictive quantization system for causally transmitting parallel sources with temporal memory (colored frames) over an erasure channel. By optimizing within t...
143
click to vote
AAAI
2010
15 years 8 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
188
click to vote
CCCG
2003
15 years 8 months ago
2003
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...