Sciweavers

1797 search results - page 281 / 360
» Regularized Winnow Methods
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
AOSD
2011
ACM
13 years 4 months ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
11 years 11 months ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
BMCBI
2008
177views more  BMCBI 2008»
13 years 9 months ago
Baseline Correction for NMR Spectroscopic Metabolomics Data Analysis
Background: We propose a statistically principled baseline correction method, derived from a parametric smoothing model. It uses a score function to describe the key features of b...
Yuanxin Xi, David M. Rocke
BMCBI
2006
86views more  BMCBI 2006»
13 years 9 months ago
The impact of sample imbalance on identifying differentially expressed genes
Background: Recently several statistical methods have been proposed to identify genes with differential expression between two conditions. However, very few studies consider the p...
Kun Yang, Jianzhong Li, Hong Gao