7623 search results - page 1007 / 1525 » Constructive Volume Modeling |
175
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
206
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
156
click to vote
EUROCRYPT
2005
Springer
16 years 15 days ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
221
click to vote
BIRTHDAY
2004
Springer
16 years 11 days ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
173
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a s...