234 search results - page 34 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
178
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
165
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
155
click to vote
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
180
click to vote
FSTTCS
2009
Springer
16 years 21 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
162
click to vote
SC
1995
ACM
15 years 9 months ago
1995
ACM
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...