598 search results - page 45 / 120 » Predicting Lattice Reduction |
165
click to vote
ACRI
2010
Springer
15 years 3 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
146
click to vote
HPCA
2003
IEEE
16 years 4 months ago
2003
IEEE
With the constant advances in technology that lead to the increasing of the transistor count and processor frequency, power dissipation is becoming one of the major issues in high...
126
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
123
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...
128
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...