521 search results - page 36 / 105 » Coring method for clustering a graph |
142
click to vote
TSP
2010
14 years 11 months ago
2010
We propose a method to count and estimate the mixing directions in an underdetermined multichannel mixture. The approach is based on the hypothesis that in the neighbourhood of som...
118
Voted
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
165
Voted
PAMI
2007
15 years 3 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
125
click to vote
ICWE
2005
Springer
15 years 9 months ago
2005
Springer
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
132
Voted
PR
2007
15 years 3 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...