807 search results - page 4 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
TKDE
2008
14 years 9 months ago
2008
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
110
click to vote
ACST
2006
14 years 11 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
IJCAI
2007
14 years 11 months ago
2007
We investigate three parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2) Variabl...
112
click to vote
DASFAA
2004
IEEE
15 years 1 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...