3818 search results - page 490 / 764 » Word Problems on Compressed Words |
187
click to vote
JSC
2010
15 years 5 months ago
2010
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
172
click to vote
JUCS
2010
15 years 5 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
196
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
176
click to vote
PAMI
2010
15 years 5 months ago
2010
—We consider the problem of inferring and modeling topics in a sequence of documents with known publication dates. The documents at a given time are each characterized by a topic...
182
click to vote
PC
2010
15 years 5 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...