2095 search results - page 204 / 419 » Improved pebbling bounds |
141
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...
142
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...
184
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...
158
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...
177
click to vote
COMCOM
2004
15 years 6 months ago
2004
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...