Sciweavers

1688 search results - page 88 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 10 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
JFP
2006
113views more  JFP 2006»
13 years 10 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
BMVC
2010
13 years 8 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann
ICIP
1998
IEEE
14 years 11 months ago
Generalized Distance based Matching of Nonbinary Images
We develope a technique to perform e cient and accurate matching to detect the occurences of a template in a scene. The template may describe an object or a textured surface. Repr...
Bülent Sankur, Cenk Köse, Valery V. Star...
IPPS
2006
IEEE
14 years 4 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...