8 search results - page 1 / 2 » Hierarchical Eigensolver for Transition Matrices in Spectral... |
NIPS
2004
14 years 16 days ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
UAI
2003
14 years 15 days 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 4 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...
INFOCOM
2003
IEEE
14 years 4 months ago
2003
IEEE
Abstract— We perform spectral analysis of the Internet topology at the AS level, by adapting the standard spectral filtering method of examining the eigenvectors corresponding t...
ICCAD
2009
IEEE
13 years 9 months ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...