139 search results - page 21 / 28 » Approximations of upper and lower probabilities by measurabl... |
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
COCO
2004
Springer
15 years 2 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
JSAC
2008
14 years 9 months ago
2008
Abstract--We consider the design of multiple-input multipleoutput communication systems with a linear precoder at the transmitter, zero-forcing decision feedback equalization (ZFDF...