1538 search results - page 18 / 308 » Spectral Techniques in Graph Algorithms |
PAMI
2007
13 years 7 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper proposes a new framework to image segmentation which combines edge- and region-based information with spectral techniques through the morphological algorithm of watersh...
GD
2003
Springer
14 years 28 days ago
2003
Springer
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...
TWC
2010
13 years 2 months ago
2010
We consider a frequency division multiplexed (FDM) system where each user employs a continuous phase modulation (CPM), serially concatenated with an outer code through an interleav...
IGARSS
2010
13 years 5 months ago
2010
This paper explores the applicability of new sparse algorithms to perform spectral unmixing of hyperspectral images using available spectral libraries instead of resorting to well...