Sciweavers

3250 search results - page 187 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
COR
2006
113views more  COR 2006»
15 years 6 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
16 years 7 hour ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 6 months ago
LSMR: An iterative algorithm for sparse least-squares problems
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
David Fong, Michael Saunders
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
15 years 12 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny