Sciweavers

368 search results - page 22 / 74
» Higher Eigenvalues of Graphs
Sort
View
CIS
2010
Springer
13 years 2 months ago
Sensor Graphs for Guaranteed Cooperative Localization Performance
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
Y. Yuan, H. G. Tanner
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 2 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...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
14 years 1 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
IMC
2010
ACM
13 years 5 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
14 years 1 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