Sciweavers

1746 search results - page 317 / 350
» On Compressibility of Protein Sequences
Sort
View
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 7 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 5 months ago
Real-time Robust Principal Components' Pursuit
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
Chenlu Qiu, Namrata Vaswani
IPPS
2009
IEEE
14 years 3 months ago
Accelerating HMMer on FPGAs using systolic array based architecture
HMMer is a widely-used bioinformatics software package that uses profile HMMs (Hidden Markov Models) to model the primary structure consensus of a family of protein or nucleic aci...
Yanteng Sun, Peng Li, Guochang Gu, Yuan Wen, Yuan ...
CEC
2005
IEEE
14 years 2 months ago
Multiobjective clustering around medoids
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
Julia Handl, Joshua D. Knowles
CCGRID
2003
IEEE
14 years 2 months ago
A Parallel FPT Application For Clusters
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
James Cheetham, Frank K. H. A. Dehne, Andrew Rau-C...