Sciweavers

87 search results - page 4 / 18
» Limits of dense graph sequences
Sort
View
RSA
2006
110views more  RSA 2006»
14 years 11 months ago
The degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
Jonathan Jordan
166
Voted
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 1 days ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
RSA
2010
108views more  RSA 2010»
14 years 10 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
FGR
1996
IEEE
117views Biometrics» more  FGR 1996»
15 years 4 months ago
Tracking and Learning Graphs and Pose on Image Sequences of Faces
We demonstrate a system capable of tracking, in real world image sequences, landmarks such as eyes, mouth, or chin on a face. In the standard version, knowledge previously collect...
Thomas Maurer, Christoph von der Malsburg
CVPR
2010
IEEE
15 years 8 months ago
Sufficient Dimensionality Reduction for Visual Sequence Classification
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
Alex Shyr, Raquel Urtasun, Michael Jordan