Sciweavers

1977 search results - page 212 / 396
» The satisfactory partition problem
Sort
View
VLDB
2003
ACM
123views Database» more  VLDB 2003»
16 years 6 months ago
A case for fractured mirrors
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
Ravishankar Ramamurthy, David J. DeWitt, Qi Su
EDBT
2004
ACM
142views Database» more  EDBT 2004»
16 years 6 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
EDBT
2006
ACM
191views Database» more  EDBT 2006»
16 years 6 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
16 years 3 months ago
On the Comparison of Relative Clustering Validity Criteria.
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
Lucas Vendramin, Ricardo J. G. B. Campello, Eduard...
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
16 years 3 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee