4616 search results - page 365 / 924 » The Communication Complexity of Correlation |
203
click to vote
EUROCRYPT
2000
Springer
15 years 11 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
221
click to vote
COCO
2010
Springer
15 years 9 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
196
Voted
DM
2002
15 years 7 months ago
2002
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...
193
click to vote
ACSC
2008
IEEE
16 years 2 months 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...
207
Voted
ICIP
2001
IEEE
16 years 9 months ago
2001
IEEE
A multiple description scalar quantization (MDSQ) based coding system can be regarded as a source coder (quantizer) followed by a channel coder, i.e. the combination of index and ...