Sciweavers

130 search results - page 5 / 26
» Algorithms for Finding a Most Similar Subforest
Sort
View
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
14 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
CVPR
2005
IEEE
15 years 11 months ago
Efficient Mean-Shift Tracking via a New Similarity Measure
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
GCB
2006
Springer
99views Biometrics» more  GCB 2006»
15 years 1 months ago
Shape Distributions and Protein Similarity
: In this paper we describe a similarity model that provides the objective basis for clustering proteins of similar structure. More specifically, we consider the following variant ...
Stefan Canzar, Jan Remy
77
Voted
AI
2010
Springer
14 years 9 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
PR
2008
117views more  PR 2008»
14 years 9 months ago
A scale-free distribution of false positives for a large class of audio similarity measures
The "bag-of-frames" approach (BOF) to audio pattern recognition models signals as the long-term statistical distribution of their local spectral features, a prototypical...
Jean-Julien Aucouturier, François Pachet