3415 search results - page 280 / 683 » Lower bounds on kernelization |
206
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
161
click to vote
WSC
2007
15 years 9 months ago
2007
The HLA time management is an important factor that limits the scalability of distributed simulations. An efficient algorithm of Greatest Available Logical Time (GALT) is thus muc...
152
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
144
click to vote
CCCG
2006
15 years 8 months ago
2006
We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
174
click to vote
NIPS
2004
15 years 8 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...