Sciweavers

807 search results - page 4 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
TKDE
2008
112views more  TKDE 2008»
13 years 7 months ago
IDD: A Supervised Interval Distance-Based Method for Discretization
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...
Francisco J. Ruiz, Cecilio Angulo, Núria Ag...
ICIP
2009
IEEE
13 years 5 months ago
Graph-based foreground extraction in extended color space
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...
Hansung Kim, Adrian Hilton
ACST
2006
13 years 8 months ago
An efficient search algorithm for partially ordered sets
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...
Yan Chen
IJCAI
2007
13 years 8 months ago
A Comparison of Time-Space Schemes for Graphical Models
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...
Robert Mateescu, Rina Dechter
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
13 years 11 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
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...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...