2095 search results - page 153 / 419 » Improved pebbling bounds |
166
click to vote
IMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adver...
161
click to vote
EVOW
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. Motivated by parallel optimization, we study the SelfAdaptation algorithm for large population sizes. We first show that the current version of this algorithm does not r...
144
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
165
click to vote
WSC
2007
15 years 8 months ago
2007
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
171
click to vote
NIPS
2004
15 years 7 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...