Sciweavers

1381 search results - page 80 / 277
» Structural signatures for tree data structures
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 3 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
15 years 11 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
CVPR
2011
IEEE
14 years 6 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
EDBT
2009
ACM
110views Database» more  EDBT 2009»
15 years 2 months ago
A sampling approach for XML query selectivity estimation
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yu, Qia...