Sciweavers

4137 search results - page 11 / 828
» On the number of matchings of a tree
Sort
View
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
14 years 9 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
ICRA
2006
IEEE
139views Robotics» more  ICRA 2006»
14 years 1 months ago
Adaptive Geometric Templates for Feature Matching
Robust motion recovery in tracking multiple targets using image features is affected by difficulties in obtaining good correspondences over long sequences. Difficulties are intr...
Harini Veeraraghavan, Paul R. Schrater, Nikolaos P...
JUCS
2010
130views more  JUCS 2010»
13 years 6 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
ECCV
2008
Springer
14 years 9 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
COMBINATORICS
2007
69views more  COMBINATORICS 2007»
13 years 7 months ago
On the Number of Genus One Labeled Circle Trees
A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-...
Karola Mészáros