Sciweavers

4666 search results - page 567 / 934
» Equations on Timed Languages
Sort
View
ICALP
1992
Springer
15 years 11 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
ACCV
2007
Springer
15 years 11 months ago
Efficient Search in Document Image Collections
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
Anand Kumar 0002, C. V. Jawahar, R. Manmatha
ICALP
2007
Springer
15 years 10 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan
APCSAC
2001
IEEE
15 years 10 months ago
Stacking them up: a Comparison of Virtual Machines
A popular trend in current software technology is to gain program portability by compiling programs to an inte form based on an abstract machine definition. Such approaches date b...
K. John Gough
ICALP
2000
Springer
15 years 10 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera