Sciweavers

267 search results - page 9 / 54
» Communication Complexity Under Product and Nonproduct Distri...
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
PERCOM
2011
ACM
12 years 11 months ago
Distributed context-aware visualization
—We present a visualization framework integrated in a context-aware system that uses a common underlying stream processing middleware for tight integration of data accessing, pro...
Harald Sanftmann, Nazario Cipriani, Daniel Weiskop...
NIPS
2007
13 years 8 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
LCPC
2007
Springer
14 years 1 months ago
Automatic Communication Performance Debugging in PGAS Languages
Recent studies have shown that programming in a Partition Global Address Space (PGAS) language can be more productive than programming in a message passing model. One reason for th...
Jimmy Su, Katherine A. Yelick
ICDCS
2010
IEEE
13 years 11 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...