Sciweavers

2080 search results - page 81 / 416
» Collections, Cardinalities, and Relations
Sort
View
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 4 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 3 months ago
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
Arya Mazumdar, Alexander Barg, Navin Kashyap
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 9 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
TMA
2012
Springer
278views Management» more  TMA 2012»
14 years 1 months ago
tsdb: A Compressed Database for Time Series
Large-scale network monitoring systems require efficient storage and consolidation of measurement data. Relational databases and popular tools such as the Round-Robin Database sho...
Luca Deri, Simone Mainardi, Francesco Fusco
HICSS
2000
IEEE
154views Biometrics» more  HICSS 2000»
15 years 10 months ago
Anti-Serendipity: Finding Useless Documents and Similar Documents
The problem of finding your way through a relatively unknown collection of digital documents can be daunting. Such collections sometimes have few categories and little hierarchy, ...
James W. Cooper, John M. Prager