Sciweavers

967 search results - page 121 / 194
» Building a Calculus of Data Structures
Sort
View
ACL
2001
13 years 9 months ago
Practical Issues in Compiling Typed Unification Grammars for Speech Recognition
Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are diff...
John Dowding, Beth Ann Hockey, Jean Mark Gawron, C...
KDID
2004
132views Database» more  KDID 2004»
13 years 9 months ago
An Automata Approach to Pattern Collections
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
RIAO
2004
13 years 9 months ago
Information retrieval on mixed written and spoken documents
While advances have been made in structuring, indexing and retrieval of multimedia documents, we propose to study the unexplored problematics of information retrieval on heterogen...
Benoît Favre, Patrice Bellot, Jean-Fran&cced...
JODL
2006
64views more  JODL 2006»
13 years 7 months ago
Support for XML markup of image-based electronic editions
Image-based electronic editions enable researchers to view and study in an electronic environment historical manuscript images intricately linked to edition, transcript, glossary a...
Alex Dekhtyar, Ionut Emil Iacob, Jerzy W. Jaromczy...
TCS
2008
13 years 7 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq