Sciweavers

43 search results - page 4 / 9
» Reducing the Storage Burden via Data Deduplication
Sort
View
ICDCS
2010
IEEE
14 years 14 days ago
New Algorithms for Planning Bulk Transfer via Internet and Shipping Networks
—Cloud computing is enabling groups of academic collaborators, groups of business partners, etc., to come together in an ad-hoc manner. This paper focuses on the group-based data...
Brian Cho, Indranil Gupta
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
14 years 9 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
BTW
2007
Springer
185views Database» more  BTW 2007»
14 years 2 months ago
Data Staging for OLAP- and OLTP-Applications on RFID Data
: The emerging trend towards seamless monitoring of all business processes via comprehensive sensor networks – in particular RFID readers – creates new data management challeng...
Stefan Krompass, Stefan Aulbach, Alfons Kemper
MICRO
1996
IEEE
96views Hardware» more  MICRO 1996»
14 years 21 days ago
Exceeding the Dataflow Limit via Value Prediction
For decades, the serialization constraints imposed by true data dependences have been regarded as an absolute limit--the dataflow limit--on the parallel execution of serial progra...
Mikko H. Lipasti, John Paul Shen
CIDM
2007
IEEE
14 years 16 days ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...