28357 search results - page 259 / 5672 » Communications |
177
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
190
click to vote
IEEEPACT
2007
IEEE
16 years 28 days ago
2007
IEEE
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the pro...
163
Voted
DIGRA
2003
Springer
15 years 12 months ago
2003
Springer
Communication between players in networked computer games is often inadequately implemented. The games do not exploit the full potential of using different forms of communication ...
189
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
169
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...