Sciweavers

2270 search results - page 23 / 454
» On the distribution of eigenvalues of graphs
Sort
View
ISBI
2011
IEEE
14 years 5 months ago
Differential information content in staggered multiple shell hardi measured by the tensor distribution function
Diffusion tensor imaging has accelerated the study of brain connectivity, but single-tensor diffusion models are too simplistic to model fiber crossing and mixing. Hybrid diffusio...
Liang Zhan, Alex D. Leow, Iman Aganj, Christophe L...
SIAMMAX
2011
111views more  SIAMMAX 2011»
14 years 8 months ago
Ergodicity Coefficients Defined by Vector Norms
Abstract. Ergodicity coefficients for stochastic matrices determine inclusion regions for subdominant eigenvalues; estimate the sensitivity of the stationary distribution to change...
Ilse C. F. Ipsen, Teresa M. Selee
ICPR
2008
IEEE
15 years 8 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock
106
Voted
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
15 years 6 months ago
oddball: Spotting Anomalies in Weighted Graphs
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
Leman Akoglu, Mary McGlohon, Christos Faloutsos
112
Voted
COMBINATORICS
2006
221views more  COMBINATORICS 2006»
15 years 1 months ago
Kernels of Directed Graph Laplacians
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
John S. Caughman IV, J. J. P. Veerman