276 search results - page 24 / 56 » Lower bounds for the complexity of linear functionals in the... |
166
click to vote
MP
2007
15 years 5 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...
156
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
180
click to vote
NIPS
2003
15 years 7 months ago
2003
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
196
click to vote
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
168
click to vote
IWPEC
2009
Springer
16 years 22 days ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...