Sciweavers

1488 search results - page 241 / 298
» A Probabilistic Segmentation Scheme
Sort
View
ASIACRYPT
2011
Springer
14 years 6 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 1 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
CVPR
2009
IEEE
17 years 1 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...
ICCV
2009
IEEE
16 years 11 months ago
Which Faces to Tag: Adding Prior Constraints into Active Learning
We introduce an algorithm that guides the user to tag faces in the best possible order during a face recognition assisted tagging scenario. In particular, we extend the active l...
Ashish Kapoor, Gang Hua, Amir Akbarzadeh and Simon...
CVPR
1998
IEEE
16 years 8 months ago
An Optimized Interaction Strategy for Bayesian Relevance Feedback
A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]....
Ingemar J. Cox, Matthew L. Miller, Thomas P. Minka...