1977 search results - page 129 / 396 » The satisfactory partition problem |
194
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
133
click to vote
ICPR
2008
IEEE
16 years 28 days ago
2008
IEEE
To find how many clusters in a sample set is an old yet unsolved problem in unsupervised clustering. Many segmentation methods require the user to specify the number of regions in...
160
click to vote
ISAAC
2007
Springer
16 years 19 days ago
2007
Springer
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
222
click to vote
DEXAW
2005
IEEE
16 years 3 days ago
2005
IEEE
One specific problem in wide-area distributed computing environment is effective management of the vast amount of resources that are made available within the grid environment. Th...
169
click to vote
ISPD
2005
ACM
16 years 2 days ago
2005
ACM
In this paper, we develop a mixed-size placement tool, Dragon2005, to solve large scale placement problems effectively. A top-down hierarchical approach based on min-cut partition...