Sciweavers

5595 search results - page 257 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 6 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
DAC
2001
ACM
16 years 7 months ago
Performance-Driven Multi-Level Clustering with Application to Hierarchical FPGA Mapping
In this paper, we study the problem of performance-driven multi-level circuit clustering with application to hierarchical FPGA designs. We first show that the performance-driven m...
Jason Cong, Michail Romesis
ADBIS
2007
Springer
143views Database» more  ADBIS 2007»
16 years 19 days ago
Aggregating Multiple Instances in Relational Database Using Semi-Supervised Genetic Algorithm-based Clustering Technique
In solving the classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets sto...
Rayner Alfred, Dimitar Kazakov
CAD
2010
Springer
15 years 6 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
CIDM
2007
IEEE
16 years 24 days ago
Mining Subspace Correlations
— In recent applications of clustering such as gene expression microarray analysis, collaborative filtering, and web mining, object similarity is no longer measured by physical ...
Rave Harpaz, Robert M. Haralick