Sciweavers

1960 search results - page 90 / 392
» A Hidden Markov Model Information Retrieval System
Sort
View
TIT
2008
102views more  TIT 2008»
15 years 4 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
FLAIRS
2000
15 years 5 months ago
Fundamental Properties of the Core Matching Functions for Information Retrieval
Traditional benchmarking methods for information retrieval (IR) are based on experimental performance evaluation. Although the metrics precision and recall can measure the perform...
Dawei Song, Kam-Fai Wong, Peter Bruza, Chun Hung C...
ICML
1998
IEEE
16 years 5 months ago
Heading in the Right Direction
Stochastic topological models, and hidden Markov models in particular, are a useful tool for robotic navigation and planning. In previous work we have shown how weak odometric dat...
Hagit Shatkay, Leslie Pack Kaelbling
PAMI
2002
108views more  PAMI 2002»
15 years 4 months ago
Approximate Bayes Factors for Image Segmentation: The Pseudolikelihood Information Criterion (PLIC)
We propose a method for choosing the number of colors or true gray levels in an image; this allows fully automatic segmentation of images. Our underlying probability model is a hid...
Derek C. Stanford, Adrian E. Raftery
ER
2007
Springer
142views Database» more  ER 2007»
15 years 10 months ago
Automatic Hidden-Web Table Interpretation by Sibling Page Comparison
The longstanding problem of automatic table interpretation still illudes us. Its solution would not only be an aid to table processing applications such as large volume table conve...
Cui Tao, David W. Embley