Sciweavers

36 search results - page 7 / 8
» Conditional value at risk and related linear programming mod...
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 4 days ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
ESANN
2004
13 years 8 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
CP
2001
Springer
13 years 11 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
PAMI
2002
201views more  PAMI 2002»
13 years 6 months ago
ICP Registration Using Invariant Features
This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwisecorrespondences are chosen as...
Gregory C. Sharp, Sang Wook Lee, David K. Wehe
RECOMB
2009
Springer
14 years 7 months ago
Shared Peptides in Mass Spectrometry Based Protein Quantification
In analyzing the proteome using mass spectrometry, the mass values help identify the molecules, and the intensities help quantify them, relative to their abundance in other sample...
Banu Dost, Nuno Bandeira, Xiangqian Li, Zhouxin Sh...