Sciweavers

160 search results - page 13 / 32
» Similarity measurement on leaf-labelled trees
Sort
View
SPIRE
2007
Springer
14 years 1 months ago
Generalized LCS
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva ...
AUSAI
2006
Springer
13 years 11 months ago
Lazy Learning for Improving Ranking of Decision Trees
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...
Han Liang, Yuhong Yan
TIP
2008
219views more  TIP 2008»
13 years 7 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
PAMI
2007
166views more  PAMI 2007»
13 years 7 months ago
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
Dariu Gavrila