Sciweavers

116 search results - page 21 / 24
» Minimum Message Length Hidden Markov Modelling
Sort
View
AAAI
2008
14 years 5 days ago
Extracting Relevant Snippets for Web Navigation
Search engines present fix-length passages from documents ranked by relevance against the query. In this paper, we present and compare novel, language-model based methods for extr...
Qing Li, K. Selçuk Candan, Qi Yan
EMNLP
2009
13 years 7 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner
JCDL
2006
ACM
176views Education» more  JCDL 2006»
14 years 3 months ago
A hierarchical, HMM-based automatic evaluation of OCR accuracy for a digital library of books
A number of projects are creating searchable digital libraries of printed books. These include the Million Book Project, the Google Book project and similar efforts from Yahoo an...
Shaolei Feng, R. Manmatha
TASLP
2010
157views more  TASLP 2010»
13 years 4 months ago
HMM-Based Reconstruction of Unreliable Spectrographic Data for Noise Robust Speech Recognition
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
Bengt J. Borgstrom, Abeer Alwan
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 9 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin