3875 search results - page 748 / 775 » Approximation algorithms for the 0-extension problem |
CSL
2010
Springer
14 years 9 months ago
2010
Springer
We propose a unified global entropy reduction maximization (GERM) framework for active learning and semi-supervised learning for speech recognition. Active learning aims to select...
TCSV
2008
14 years 9 months ago
2008
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
105
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...