2 search results - page 1 / 1 » Tight Estimates for Eigenvalues of Regular Graphs |
87
Voted
COMBINATORICS
2004
14 years 9 months ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper addresses the problem of segmenting an image into regions consistent with user-supplied seeds (e.g., a sparse set of broad brush strokes). We view this task as a statis...