526 search results - page 82 / 106 » Increments of Random Partitions |
ANCS
2009
ACM
13 years 6 months ago
2009
ACM
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we propose a Bayesian approach to video object segmentation. Our method consists of two stages. In the first stage, we partition the video data into a set of 3D wate...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
Abstract: We propose a hyperspectral image compressor called BH which considers its input image as being partitioned into square blocks, each lying entirely within a particular ban...