1622 search results - page 210 / 325 » Learning a Hidden Matching |
134
Voted
SPEECH
2008
15 years 3 months ago
2008
The ever-increasing volume of audio data available online through the world wide web means that automatic methods for indexing and search are becoming essential. Hidden Markov mod...
152
Voted
TCBB
2011
14 years 10 months ago
2011
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...
131
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We present a new unsupervised method to learn unified probabilistic object models (POMs) which can be applied to classification, segmentation, and recognition. We formulate this a...
136
Voted
IBPRIA
2009
Springer
15 years 8 months ago
2009
Springer
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
149
Voted
LLL
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...