Sciweavers

91 search results - page 15 / 19
» Multiparty Communication Complexity of Disjointness
Sort
View
SIGMOD
2005
ACM
156views Database» more  SIGMOD 2005»
14 years 7 months ago
Model-driven design of service-enabled web applications
Significant efforts are currently invested in application integration to enable the interaction and composition of business processes of different companies, yielding complex, mul...
Marco Brambilla, Stefano Ceri, Piero Fraternali, R...
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 1 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
ASIACRYPT
2007
Springer
13 years 11 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
SIGMETRICS
2000
ACM
217views Hardware» more  SIGMETRICS 2000»
13 years 7 months ago
Experimenting with an Ad Hoc wireless network on campus: insights and experiences
Ad hoc wireless networks are new communication networks that can be dynamically formed and deformed onthe- y, anytime and anywhere. User data is routed with the help of an ad hoc ...
Chai-Keong Toh, Richard Chen, Minar Delwar, Donald...