Sciweavers

4137 search results - page 45 / 828
» On the number of matchings of a tree
Sort
View
APSCC
2008
IEEE
14 years 2 months ago
Deciding the Number of Color Histogram Bins for Vehicle Color Recognition
Given vehicle images, we suggest a way to recognize the color of the vehicle contained in the image. The color feature of a vehicle is represented by a color histogram, and we dec...
Ku-Jin Kim, Sun-Mi Park, Yoo-Joo Choi
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...
IPL
2006
103views more  IPL 2006»
13 years 7 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...