370 search results - page 53 / 74 » Bounded modified realizability |
124
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
188
click to vote
CAP
2010
14 years 10 months ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
115
click to vote
JMLR
2010
14 years 10 months ago
2010
Imitation Learning, while applied successfully on many large real-world problems, is typically addressed as a standard supervised learning problem, where it is assumed the trainin...
121
click to vote
TON
2010
14 years 10 months ago
2010
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
134
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...