11 search results - page 2 / 3 » Maximum likelihood multiple subspace projections for hidden ... |
GCB
2000
Springer
13 years 8 months ago
2000
Springer
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
EMNLP
2004
13 years 6 months ago
2004
We compare and contrast two different models for detecting sentence-like units in continuous speech. The first approach uses hidden Markov sequence models based on N-grams and max...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In this work we introduce a probabilistic model for classifying segmented images. The proposed classifier is very general and it can deal both with images that were segmented wit...
MVA
2007
13 years 4 months ago
2007
The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Most tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework called Hidden Markov Model, where the distribution of the object state a...