Sciweavers

117 search results - page 16 / 24
» Compressing Data Cube in Parallel OLAP Systems
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 9 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
JUCS
2006
95views more  JUCS 2006»
13 years 8 months ago
Fault Tolerant Neural Predictors for Compression of Sensor Telemetry Data
: When dealing with remote systems, it is desirable that these systems are capable of operation within acceptable levels with minimal control and maintenance. In terms or transmiss...
Rajasvaran Logeswaran
ICDCS
2005
IEEE
14 years 2 months ago
Fine-Grain Adaptive Compression in Dynamically Variable Networks
Despite voluminous previous research on adaptive compression, we found significant challenges when attempting to fully utilize both network bandwidth and CPU. We describe the Fine...
Calton Pu, Lenin Singaravelu
INFOCOM
2010
IEEE
13 years 7 months ago
Compressive Oversampling for Robust Data Transmission in Sensor Networks
—Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensin...
Zainul Charbiwala, Supriyo Chakraborty, Sadaf Zahe...
IPPS
2007
IEEE
14 years 2 months ago
Combining Compression, Encryption and Fault-tolerant Coding for Distributed Storage
Storing data in distributed systems aims to offer higher bandwidth and scalability than storing locally. But, a couple of disadvantageous issues must be taken into account such as...
Peter Sobe, Kathrin Peter