163 search results - page 22 / 33 » Tight Approximability Results for Test Set Problems in Bioin... |
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
EUROGP
2004
Springer
14 years 27 days ago
2004
Springer
Lymphoma cancer classification with DNA microarray data is one of important problems in bioinformatics. Many machine learning techniques have been applied to the problem and produc...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
NCA
2006
IEEE
13 years 7 months ago
2006
IEEE
Scientists involved in the area of proteomics are currently seeking integrated, customised and validated research solutions to better expedite their work in proteomics analyses and...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We address the problem of parameter estimation in presence
of both uncertainty and outlier noise. This is a common
occurrence in computer vision: feature localization
is perform...