Sciweavers

906 search results - page 30 / 182
» Matching Subsequences in Trees
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Shape Retrieval using Concavity Trees
y trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The...
Mohamed Kamel, Ossama El Badawy
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 8 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
11 years 10 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ICANN
2011
Springer
12 years 11 months ago
Extending Tree Kernels with Topological Information
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 9 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...