261 search results - page 31 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
140
Voted
MOR
2000
15 years 1 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
123
click to vote
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
101
Voted
WAOA
2007
Springer
15 years 7 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
124
Voted
MP
2007
15 years 1 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
127
Voted
JMLR
2012
13 years 4 months ago
2012
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothe...