3818 search results - page 77 / 764 » Word Problems on Compressed Words |
125
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
113
click to vote
ACL
2008
15 years 6 months ago
2008
In this paper, we study the problem of summarizing email conversations. We first build a sentence quotation graph that captures the conversation structure among emails. We adopt t...
159
click to vote
ICVGIP
2004
15 years 5 months ago
2004
Searching in scanned documents is an important problem in Digital Libraries. If OCRs are not available, the scanned images are inaccessible. In this paper, we demonstrate a search...
139
click to vote
ESWA
2007
15 years 4 months ago
2007
Hidden Markov Models, or HMMs for short, have been recently used in Bioinformatics for the classification of DNA or protein chains, giving rise to what is known as Profile Hidde...
147
click to vote
EMNLP
2011
14 years 4 months ago
2011
Machine-produced text often lacks grammaticality and fluency. This paper studies grammaticality improvement using a syntax-based algorithm based on CCG. The goal of the search pr...