Sciweavers

595 search results - page 14 / 119
» Languages Of Analogical Strings
Sort
View
ESWA
2008
113views more  ESWA 2008»
14 years 9 months ago
A weighted string pattern matching-based passage ranking algorithm for video question answering
Video question answering aims to pinpoint answers in response to user's specified questions. However, most question answering technologies involve in integrating rich specifi...
Yu-Chieh Wu, Jie-Chi Yang, Yue-Shi Lee
82
Voted
ICDAR
2009
IEEE
15 years 4 months ago
Indian Multi-Script Full Pin-code String Recognition for Postal Automation
Under three-language formula, the destination address block of postal document of an Indian state is generally written in three languages: English, Hindi and the State official la...
Umapada Pal, Rami Kumar Roy, Kaushik Roy, Fumitaka...
ICALP
2001
Springer
15 years 2 months ago
Combinatorics of Periods in Strings
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
Eric Rivals, Sven Rahmann
CICLING
2009
Springer
14 years 10 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
JSYML
2006
119views more  JSYML 2006»
14 years 9 months ago
0-D-valued fields
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
Nicolas Guzy