1552 search results - page 129 / 311 » On the Complexity of Constant Propagation |
165
click to vote
FC
2010
Springer
15 years 10 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
168
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
170
click to vote
AIPS
2004
15 years 7 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
145
click to vote
FLAIRS
2006
15 years 7 months ago
2006
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
208
click to vote
NIPS
2004
15 years 7 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...