Sciweavers

2270 search results - page 28 / 454
» On the distribution of eigenvalues of graphs
Sort
View
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
15 years 8 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
83
Voted
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 8 months ago
Eigenvectors of Random Graphs: Nodal Domains
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
Yael Dekel, James R. Lee, Nathan Linial
105
Voted
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
15 years 8 months ago
A graph theoretic approach to optimal target tracking for mobile robot teams
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
Jason C. Derenick, John R. Spletzer, M. Ani Hsieh
106
Voted
CVPR
2006
IEEE
16 years 3 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller
BICOB
2009
Springer
15 years 8 months ago
Graph Spectral Approach for Identifying Protein Domains
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...
Hari Krishna Yalamanchili, Nita Parekh