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...
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...
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...
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...
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...