Sciweavers

370 search results - page 53 / 74
» Bounded modified realizability
Sort
View
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 6 months ago
On optimizing over lift-and-project closures
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...
Pierre Bonami
CAP
2010
13 years 3 months ago
Parallel sparse polynomial interpolation over finite fields
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...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
JMLR
2010
101views more  JMLR 2010»
13 years 3 months ago
Efficient Reductions for Imitation Learning
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...
Stéphane Ross, Drew Bagnell
TON
2010
198views more  TON 2010»
13 years 3 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
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...
V. J. Venkataramanan, Xiaojun Lin
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 9 months ago
Recognizing string graphs in NP
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...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic