1538 search results - page 19 / 308 » Spectral Techniques in Graph Algorithms |
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
- This paper presents a spectrally-weighted balanced truncation technique for RLC interconnects, a technique needed when the interconnect circuit parameters change as a result of v...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
UAI
2003
13 years 9 months ago
2003
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
GBRPR
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
JMLR
2006
13 years 7 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...