Sciweavers

1370 search results - page 81 / 274
» On grids in topological graphs
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...
TVCG
2008
125views more  TVCG 2008»
15 years 6 months ago
GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
Daniel Archambault, Tamara Munzner, David Auber
APVIS
2008
15 years 7 months ago
Energy-Based Hierarchical Edge Clustering of Graphs
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
Hong Zhou, Xiaoru Yuan, Weiwei Cui, Huamin Qu, Bao...
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
16 years 20 days ago
Synchronization in networks of nonlinear oscillators with coupling delays
Abstract— We consider the synchronization problem of an arbitrary number of coupled nonlinear oscillators with delays in the interconnections. The emphasis is on coupled Lorenz s...
Wim Michiels, Henk Nijmeijer
FOCS
2009
IEEE
16 years 28 days ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...