Sciweavers

244 search results - page 6 / 49
» Analyzing the performance of randomized information sharing
Sort
View
SPAA
1996
ACM
13 years 12 months ago
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
INFOCOM
2010
IEEE
13 years 6 months ago
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
Kai Zeng, Daniel Wu, An Chan, Prasant Mohapatra
JDCTA
2010
250views more  JDCTA 2010»
13 years 2 months ago
A Novel Non-Expansion Visual Secret Sharing Scheme For Binary Image
In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual infor...
Thekra Abbas, Zou Beiji
BMCBI
2008
179views more  BMCBI 2008»
13 years 7 months ago
Building pathway clusters from Random Forests classification using class votes
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
Herbert Pang, Hongyu Zhao
IEEEAMS
2003
IEEE
14 years 1 months ago
Communication Pattern Based Node Selection for Shared Networks
Selection of the most suitable nodes on a network to execute a parallel application requires matching the network status to the application requirements. We propose and validate a...
Srikanth Goteti, Jaspal Subhlok