Sciweavers

1994 search results - page 305 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
IPPS
2003
IEEE
15 years 3 months ago
Short Vector Code Generation for the Discrete Fourier Transform
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
Franz Franchetti, Markus Püschel
ICPR
2010
IEEE
15 years 2 months ago
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
Jerome Revaud, Guillaume Lavoue, Yasuo Ariki, Atil...
COREGRID
2007
Springer
15 years 4 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Veronika Rehn-Sonigo
BMVC
2001
15 years 7 days ago
Deformable Spatio-Temporal Shape Models: Extending ASM to 2D+Time
This paper extends 2D Active Shape Models to 2D+time by presenting a method for modelling and segmenting spatio-temporal shapes (ST-shapes). The modelling part consists of constru...
Ghassan Hamarneh, Tomas Gustavsson