3875 search results - page 526 / 775 » Approximation algorithms for the 0-extension problem |
187
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
140
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
193
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...
177
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
162
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...