Sciweavers

240 search results - page 2 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
IPL
2007
67views more  IPL 2007»
13 years 4 months ago
A variant of the Ford-Johnson algorithm that is more space efficient
Mauricio Ayala-Rincón, Bruno T. de Abreu, J...
ICCV
2005
IEEE
14 years 6 months ago
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
Manolis I. A. Lourakis, Antonis A. Argyros
FCCM
2009
IEEE
134views VLSI» more  FCCM 2009»
13 years 8 months ago
Efficient Mapping of Hardware Tasks on Reconfigurable Computers Using Libraries of Architecture Variants
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
Miaoqing Huang, Vikram K. Narayana, Tarek A. El-Gh...
TOMS
2008
96views more  TOMS 2008»
13 years 4 months ago
Block variants of Hammarling's method for solving Lyapunov equations
This paper is concerned with the efficient numerical solution of the Lyapunov equation AT X +XA = -C with a stable matrix A and a symmetric positive semidefinite matrix C of possi...
Daniel Kressner
TCS
2008
13 years 4 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman