1647 search results - page 229 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
131
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
147
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
109
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
111
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...