Sciweavers

3130 search results - page 73 / 626
» Collusion without communication
Sort
View
SPAA
1993
ACM
15 years 9 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 5 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
158
Voted
CLUSTER
2006
IEEE
15 years 5 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
DCOSS
2009
Springer
15 years 2 months ago
Empirical Evaluation of Wireless Underground-to-Underground Communication in Wireless Underground Sensor Networks
Abstract. Many applications for irrigation management and environment monitoring exploit buried sensors wired-connected to the soil surface for information retrieval. Wireless Unde...
Agnelo R. Silva, Mehmet C. Vuran
MOBIHOC
2006
ACM
16 years 4 months ago
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Smart antennas have gained significant importance in multihop wireless networks in recent years, because of their sophisticated signal processing capabilities that hold the potent...
Karthikeyan Sundaresan, Weizhao Wang, Stephan Eide...