Sciweavers

197 search results - page 8 / 40
» Robust Parallel Computations through Randomization
Sort
View
COLCOM
2005
IEEE
15 years 3 months ago
SLACER: randomness to cooperation in peer-to-peer networks
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an...
David Hales, Stefano Arteconi, Özalp Babaoglu
DCOSS
2010
Springer
14 years 9 months ago
Design and Implementation of a Robust Sensor Data Fusion System for Unknown Signals
In this work, we present a robust sensor fusion system for exploratory data collection, exploiting the spatial redundancy in sensor networks. Unlike prior work, our system design c...
Younghun Kim, Thomas Schmid, Mani B. Srivastava
IPMI
2003
Springer
15 years 10 months ago
A New & Robust Information Theoretic Measure and Its Application to Image Alignment
In this paper we develop a novel measure of information in a random variable based on its cumulative distribution that we dub cumulative residual entropy (CRE). This measure parall...
Fei Wang, Baba C. Vemuri, Murali Rao, Yunmei Chen
CISS
2007
IEEE
14 years 9 months ago
Robust Routing in Wireless Multi-Hop Networks
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
Yuchen Wu, Alejandro Ribeiro, Georgios B. Giannaki...
CLUSTER
2006
IEEE
15 years 3 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...