1998 search results - page 178 / 400 » Complexity of the Cover Polynomial |
156
click to vote
FSE
2005
Springer
16 years 1 days ago
2005
Springer
The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators. It has the advantage that it works at rate 1/3 usin...
192
click to vote
STACS
2005
Springer
16 years 8 hour ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
165
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
131
click to vote
NIPS
2008
15 years 8 months ago
2008
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
227
click to vote
AAAI
2004
15 years 8 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...