511 search results - page 54 / 103 » Lower bounds for distributed markov chain problems |
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
We formulate a model for probability distributions on image spaces. We show that any distribution of images can be factored exactly into conditional distributions of feature vecto...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...