Sciweavers

95 search results - page 1 / 19
» Random block-angular matrices for distributed data storage
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Random block-angular matrices for distributed data storage
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
Paulo Jorge S. G. Ferreira, Bruno Jesus, Jose Viei...
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 2 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
P2P
2005
IEEE
112views Communications» more  P2P 2005»
13 years 10 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
ICDCS
2005
IEEE
13 years 10 months ago
On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems
Data reliability of distributed brick storage systems critically depends on the replica placement policy, and the two governing forces are repair speed and sensitivity to multiple...
Qiao Lian, Wei Chen, Zheng Zhang
SIGIR
2004
ACM
13 years 10 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny