335 search results - page 32 / 67 » High quality graph partitioning |
PLDI
2004
ACM
14 years 4 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
DAC
1999
ACM
14 years 12 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
ICIP
1999
IEEE
15 years 15 days ago
1999
IEEE
W e present a simple and eficient scheme for using the Set Partitioning in Hierarchical Trees (SPIHT) image compression algorithm [l]in a generalized multiple description framewor...
MLDM
2005
Springer
14 years 4 months ago
2005
Springer
In supervised machine learning, the partitioning of the values (also called grouping) of a categorical attribute aims at constructing a new synthetic attribute which keeps the info...
KDD
1995
ACM
14 years 2 months ago
1995
ACM
Clustering is often used to discover structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to se...