Sciweavers

4616 search results - page 857 / 924
» The Communication Complexity of Correlation
Sort
View
SIGECOM
2003
ACM
174views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Collaboration software to reduce inventory and increase response
Some recent trends in business and manufacturing hold the promise of greater profits, yet, due to profit-robbing inventory increases, this promise has not been fully realized. [9]...
Indu Bingham, Barbara Hoefle, Kim Phan, Jim Sizemo...
WPES
2003
ACM
15 years 11 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
ESA
2003
Springer
99views Algorithms» more  ESA 2003»
15 years 11 months ago
Adversary Immune Leader Election in ad hoc Radio Networks
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
Miroslaw Kutylowski, Wojciech Rutkowski
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr