688 search results - page 50 / 138 » Types for trees |
123
click to vote
SODA
1990
ACM
15 years 1 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
113
click to vote
EMNLP
2010
14 years 10 months ago
2010
In this paper we introduce the new task of social event extraction from text. We distinguish two broad types of social events depending on whether only one or both parties are awa...
119
click to vote
IWPC
2002
IEEE
15 years 5 months ago
2002
IEEE
A means to add explicit structure to program source code is presented. XML is used to augment source code with syntactic information from the parse tree. More importantly, comment...
95
Voted
AAAI
1997
15 years 2 months ago
1997
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
113
Voted
ENTCS
2010
15 years 26 days ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...