Sciweavers

561 search results - page 55 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
ARITH
2003
IEEE
14 years 28 days ago
Some Optimizations of Hardware Multiplication by Constant Matrices
This paper presents some improvements on the optimization of hardware multiplication by constant matrices. We focus on the automatic generation of circuits that involve constant m...
Nicolas Boullis, Arnaud Tisserand
ALGORITHMICA
2011
13 years 2 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ICIP
1999
IEEE
14 years 9 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
11 years 10 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh