1786 search results - page 111 / 358 » The Structure of Factor Oracles |
165
click to vote
ACSC
2008
IEEE
16 years 26 days ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
189
click to vote
STACS
2007
Springer
16 years 15 days 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...
150
click to vote
ASIACRYPT
2003
Springer
15 years 11 months ago
2003
Springer
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
131
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
180
click to vote
ISCA
1998
IEEE
15 years 10 months ago
1998
IEEE
Commercial applications such as databases and Web servers constitute the largest and fastest-growing segment of the market for multiprocessor servers. Ongoing innovations in disk ...