1797 search results - page 281 / 360 » Regularized Winnow Methods |
107
click to vote
SIAMSC
2010
15 years 1 days ago
2010
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...
138
click to vote
AOSD
2011
ACM
14 years 8 months ago
2011
ACM
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...
131
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
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 ...
118
click to vote
BMCBI
2008
15 years 1 months ago
2008
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...
BMCBI
2006
15 years 1 months ago
2006
Background: Recently several statistical methods have been proposed to identify genes with differential expression between two conditions. However, very few studies consider the p...