1897 search results - page 284 / 380 » Conditional Linear Planning |
114
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
125
Voted
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
93
Voted
BMCBI
2010
15 years 28 days ago
2010
Background: In the yeast Saccharomyces cerevisiae, interactions between galactose, Gal3p, Gal80p, and Gal4p determine the transcriptional status of the genes required for the gala...
143
Voted
DATAMINE
1999
15 years 14 days ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
130
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...