Sciweavers

244 search results - page 12 / 49
» Analyzing the performance of randomized information sharing
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Configuration Independent Analysis for Characterizing Shared-Memory Applications
Characterizing shared-memory applications provides insight to design efficient systems, and provides awareness to identify and correct application performance bottlenecks. Configu...
Gheith A. Abandah, Edward S. Davidson
TSP
2008
166views more  TSP 2008»
13 years 7 months ago
A Unifying Discussion of Correlation Analysis for Complex Random Vectors
The assessment of multivariate association between two complex random vectors is considered. A number of correlation coefficients based on three popular correlation analysis techni...
Peter J. Schreier
IPSN
2005
Springer
14 years 1 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
TC
2008
13 years 7 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
DIMVA
2008
13 years 8 months ago
Data Space Randomization
Over the past several years, US-CERT advisories, as well as most critical updates from software vendors, have been due to memory corruption vulnerabilities such as buffer overflo...
Sandeep Bhatkar, R. Sekar