140 search results - page 12 / 28 » Practical Suffix Tree Construction |
153
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
137
click to vote
ICDAR
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper proposes a syntactic method for detection and correction of misrecognized mathematical formulae for a practical mathematical OCR system. Linear monadic context-free tre...
177
click to vote
COLING
1996
15 years 7 months ago
1996
In this paper we show that an account for coordination can be constructed usingthederivationstructures inalexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivat...
148
click to vote
ISSAC
1994
Springer
15 years 10 months ago
1994
Springer
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
144
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...