1379 search results - page 135 / 276 » The Complexity of the Annihilating Polynomial |
190
click to vote
STACS
2005
Springer
15 years 12 months 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 ...
164
click to vote
ISAAC
2004
Springer
15 years 11 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 ...
129
click to vote
NIPS
2008
15 years 7 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,...
226
click to vote
AAAI
2004
15 years 7 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...
149
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel...