Sciweavers

425 search results - page 45 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 5 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
15 years 11 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
ADC
2003
Springer
123views Database» more  ADC 2003»
15 years 4 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
15 years 11 months ago
Mining favorable facets
The importance of dominance and skyline analysis has been well recognized in multi-criteria decision making applications. Most previous studies assume a fixed order on the attribu...
Raymond Chi-Wing Wong, Jian Pei, Ada Wai-Chee Fu, ...
ASAP
2005
IEEE
169views Hardware» more  ASAP 2005»
15 years 5 months ago
Alleviating the Data Memory Bandwidth Bottleneck in Coarse-Grained Reconfigurable Arrays
It is widely known that parallel operation execution in multiprocessor systems generates a respective increase in memory accesses. Since the memory and bus subsystems provide a li...
Grigoris Dimitroulakos, Michalis D. Galanis, Costa...