807 search results - page 64 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
128
click to vote
ATAL
2009
Springer
15 years 5 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...
116
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper introduces a clever way of computing inner products between images in order to drastically reduce the computational complexity of fitting appearance models to images. T...
103
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
144
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
148
click to vote
INFOCOM
1999
IEEE
15 years 8 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...