Sciweavers

10493 search results - page 11 / 2099
» Dynamic Word Problems
Sort
View
ICVGIP
2004
13 years 9 months ago
Searching in Document Images
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...
C. V. Jawahar, Million Meshesha, A. Balasubramania...
STRINGOLOGY
2008
13 years 9 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
ICALP
2005
Springer
14 years 1 months ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
DLT
2010
13 years 9 months ago
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
Niko Haubold, Markus Lohrey, Christian Mathissen
FLAIRS
2009
13 years 5 months ago
Automatic Text Categorization of Mathematical Word Problems
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...
Suleyman Cetintas, Luo Si, Yan Ping Xin, Dake Zhan...