Sciweavers

1977 search results - page 272 / 396
» The satisfactory partition problem
Sort
View
124
Voted
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
16 years 15 days ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
131
Voted
ICIP
2002
IEEE
16 years 5 months ago
Boosting face recognition on a large-scale database
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...
Juwei Lu, Konstantinos N. Plataniotis
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
16 years 5 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
GIS
2006
ACM
16 years 4 months ago
Optimal BSPs and rectilinear cartograms
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...
Mark de Berg, Elena Mumford, Bettina Speckmann
126
Voted
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 4 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li