Sciweavers

697 search results - page 120 / 140
» Convex Functions on Discrete Sets
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
CSDA
2006
109views more  CSDA 2006»
13 years 7 months ago
Possibility theory and statistical reasoning
Numerical possibility distributions can encode special convex families of probability measures. The connection between possibility theory and probability theory is potentially fru...
Didier Dubois
BMCBI
2010
126views more  BMCBI 2010»
13 years 7 months ago
A boosting method for maximizing the partial area under the ROC curve
Background: The receiver operating characteristic (ROC) curve is a fundamental tool to assess the discriminant performance for not only a single marker but also a score function c...
Osamu Komori, Shinto Eguchi
BMCBI
2008
92views more  BMCBI 2008»
13 years 7 months ago
A semiparametric modeling framework for potential biomarker discovery and the development of metabonomic profiles
Background: The discovery of biomarkers is an important step towards the development of criteria for early diagnosis of disease status. Recently electrospray ionization (ESI) and ...
Samiran Ghosh, David F. Grant, Dipak K. Dey, Denni...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 4 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...