Sciweavers

2 search results - page 1 / 1
» Tight Estimates for Eigenvalues of Regular Graphs
Sort
View
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
13 years 3 months ago
Tight Estimates for Eigenvalues of Regular Graphs
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...
Alon Nilli
CVPR
2008
IEEE
14 years 5 months ago
Segmentation by transduction
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...
Florent Ségonne, Jean Ponce, Jean-Yves Audi...