48 search results - page 1 / 10 » Graph partitioning via adaptive spectral techniques |
ECCC
2006
13 years 4 months ago
2006
FCT
2005
Springer
13 years 10 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
ICML
2003
IEEE
14 years 5 months ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...