484 search results - page 40 / 97 » Guessing Games and Distributed Computations in Synchronous N... |
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
15 years 4 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
103
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
CHI
2008
ACM
14 years 12 months ago
2008
ACM
Information visualizations can improve collaborative problem solving, but this improvement may depend on whether visualizations promote communication. In an experiment on the effe...
NETGAMES
2006
ACM
15 years 3 months ago
2006
ACM
Multiplayer gaming over the Internet continues to grow in popularity, despite a lack of Quality of Service (QoS) mechanisms. Future QoS-aware networks such as those based on the D...