2976 search results - page 206 / 596 » On the bounded integer programming |
160
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
148
click to vote
TALG
2010
15 years 4 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
178
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
197
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
198
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...