807 search results - page 25 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
138
click to vote
ADC
2008
Springer
15 years 6 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
184
click to vote
NAACL
2010
15 years 2 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
154
click to vote
PRIS
2004
15 years 5 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
189
click to vote
AINA
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
149
click to vote
ICMCS
2009
IEEE
15 years 1 months ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...