1957 search results - page 176 / 392 » Approximate algorithms for neural-Bayesian approaches |
174
click to vote
JMLR
2010
15 years 10 days ago
2010
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
153
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
157
click to vote
CIKM
2011
Springer
14 years 5 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
206
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
159
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a statistical learning-based solution to the camera calibration problem in which the Support Vector Machines (SVM) are used for the estimation of the projectio...