2899 search results - page 53 / 580 » Dynamic Trees in Practice |
ICDAR
2009
IEEE
13 years 6 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...
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
STOC
2000
ACM
14 years 1 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
IJCAI
1993
13 years 10 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
RP
2009
Springer
14 years 3 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...