Sciweavers

1248 search results - page 152 / 250
» On the Number of Birch Partitions
Sort
View
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 2 months ago
Parallel Algorithms for Computing Temporal Aggregates
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rod...
87
Voted
ICPR
2006
IEEE
16 years 1 months ago
Learning Pairwise Similarity for Data Clustering
Each clustering algorithm induces a similarity between given data points, according to the underlying clustering criteria. Given the large number of available clustering technique...
Ana L. N. Fred, Anil K. Jain
91
Voted
DAC
2007
ACM
16 years 1 months ago
Off-chip Decoupling Capacitor Allocation for Chip Package Co-Design
Off-chip decoupling capacitor (decap) allocation is a demanding task during package and chip codesign. Existing approaches can not handle large numbers of I/O counts and large num...
Hao Yu, Chunta Chu, Lei He
93
Voted
ICML
2009
IEEE
16 years 1 months ago
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
Xuan Vinh Nguyen, Julien Epps, James Bailey
80
Voted
CVPR
2010
IEEE
15 years 8 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun