Sciweavers

589 search results - page 45 / 118
» Matching Concavity Trees
Sort
View
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
15 years 11 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»
15 years 3 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...
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
15 years 3 months ago
Congestion reduction in traditional and new routing architectures
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
Ameya R. Agnihotri, Patrick H. Madden
ICVGIP
2004
14 years 11 months ago
3D Reconstruction of Retinal Blood Vessels from Two Views
A 3D reconstruction of retinal blood vessel trees using two views of fundus images is presented. The problem addresses: 1) The recovery of camera-eye model parameters by an self-c...
M. Elena Martínez-Pérez, Arturo Espi...
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
15 years 4 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...