1388 search results - page 56 / 278 » Querying Linguistic Trees |
132
Voted
COCOON
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
116
Voted
SSDBM
2011
IEEE
14 years 4 months ago
2011
IEEE
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
105
click to vote
ICDT
2001
ACM
15 years 5 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
134
Voted
AIMDM
1999
Springer
15 years 4 months ago
1999
Springer
Medical words exhibit a rich and productive morphology. Morphological knowledge is therefore very important for any medical language processing application. We propose a simple and...
189
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...