4007 search results - page 356 / 802 » Computation with imprecise probabilities |
183
click to vote
ICIAP
2007
ACM
16 years 7 months ago
2007
ACM
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...
216
click to vote
DCC
2007
IEEE
16 years 7 months ago
2007
IEEE
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
197
click to vote
DCC
2006
IEEE
16 years 7 months ago
2006
IEEE
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
196
click to vote
DCC
2002
IEEE
16 years 7 months ago
2002
IEEE
On-line adaptation to nonstationary distributions is essential to good performance in image coding. Fixed-size contexts (with adaptive tables) are also widely used, in conjunction...
232
click to vote
CVPR
2010
IEEE
16 years 4 months ago
2010
IEEE
We propose a calibration-free gaze sensing method using visual saliency maps. Our goal is to construct a gaze estimator only using eye images captured from a person watching a vid...