Sciweavers

140 search results - page 12 / 28
» Practical Suffix Tree Construction
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
Safraless Decision Procedures
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...
Orna Kupferman, Moshe Y. Vardi
ICDAR
2009
IEEE
13 years 5 months ago
Syntactic Detection and Correction of Misrecognitions in Mathematical OCR
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...
Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida
COLING
1996
13 years 9 months ago
Coordination in Tree Adjoining Grammars: Formalization and Implementation
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...
Anoop Sarkar, Aravind K. Joshi
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
14 years 4 days ago
Constructing Permutation Representations for Large Matrix Groups
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,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
ECAI
2004
Springer
14 years 1 months ago
Tractable Symmetry Breaking Using Restricted Search Trees
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...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...