2040 search results - page 274 / 408 » Approximate Expectation Maximization |
120
Voted
ESM
2000
15 years 4 months ago
2000
Blocking probabilities in Wavelength Division Multiplex optical networks are hard to compute for realistic sized systems, even though analytical formulas for the distribution exis...
129
click to vote
NIPS
1998
1998
Probabilistic Modeling for Face Orientation Discrimination: Learning from Labeled and Unlabeled Data
15 years 4 months ago
This paper presents probabilistic modeling methods to solve the problem of discriminating between five facial orientations with very little labeled data. Three models are explored...
149
click to vote
WCE
2007
15 years 4 months ago
2007
— Texture analysis plays an increasingly important role in computer vision. Since the textural properties of images appear to carry useful information for discrimination purposes...
132
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
119
Voted
CLEF
2009
Springer
15 years 4 months ago
2009
Springer
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...