6142 search results - page 533 / 1229 » The Complexity of Partition Functions |
173
click to vote
ATAL
2003
Springer
16 years 8 days ago
2003
Springer
Abstract. A self-organising system functions without central control, and through contextual local interactions. Components achieve a simple task individually, but a complex collec...
174
click to vote
COMPSAC
2002
IEEE
16 years 2 hour ago
2002
IEEE
Achievement of quality in software design, while never easy, is made more difficult by the inherent complexity of hard real-time (HRT) design. Furthermore, timing requirements in...
191
click to vote
FSE
1993
Springer
15 years 11 months ago
1993
Springer
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
201
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
150
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...