Sciweavers

244 search results - page 10 / 49
» Analyzing the performance of randomized information sharing
Sort
View
DAMON
2008
Springer
13 years 9 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
ICCS
2009
Springer
14 years 2 months ago
A Holistic Approach for Performance Measurement and Analysis for Petascale Applications
Abstract. Contemporary high-end Terascale and Petascale systems are composed of hundreds of thousands of commodity multi-core processors interconnected with high-speed custom netwo...
Heike Jagode, Jack Dongarra, Sadaf R. Alam, Jeffre...
WWW
2010
ACM
13 years 8 months ago
Randomization tests for distinguishing social influence and homophily effects
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...
Timothy La Fond, Jennifer Neville
RSA
2000
170views more  RSA 2000»
13 years 7 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
IJCV
2006
206views more  IJCV 2006»
13 years 7 months ago
Random Sampling for Subspace Face Recognition
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
Xiaogang Wang, Xiaoou Tang