Sciweavers

3630 search results - page 117 / 726
» Fast Marching Methods
Sort
View
ISM
2006
IEEE
174views Multimedia» more  ISM 2006»
15 years 8 months ago
Fast Similarity Search for High-Dimensional Dataset
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Quan Wang, Suya You
DATE
2003
IEEE
91views Hardware» more  DATE 2003»
15 years 7 months ago
Fast and Accurate Multiprocessor Architecture Exploration with Symbolic Programs
In system-level platform-based embedded systems design, the mapping model is a crucial link between the application model and the architecture model. All three models must match w...
Vladimir D. Zivkovic, Erwin A. de Kock, Pieter van...
EUROCRYPT
1999
Springer
15 years 6 months ago
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
Thomas Johansson, Fredrik Jönsson
BMVC
2000
15 years 3 months ago
Fast Computation of a Boundary Preserving Estimate of Optical Flow
In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for vel...
Rosario El-Feghali, Amar Mitiche
153
Voted
CVPR
2004
IEEE
16 years 4 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell