6142 search results - page 916 / 1229 » The Complexity of Partition Functions |
152
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
163
click to vote
EUROGP
2009
Springer
16 years 1 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
170
click to vote
FC
2009
Springer
16 years 1 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
170
Voted
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
186
click to vote
FIMH
2009
Springer
16 years 1 months ago
2009
Springer
Automated motion tracking of the myocardium from 3D echocardiography provides insight into heart’s architecture and function. We present a method for 3D cardiac motion tracking u...