368 search results - page 28 / 74 » Higher Eigenvalues of Graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We study the problem of distributed control of a large network of double-integrator agents to maintain a rigid formation. A few lead vehicles are given information on the desired t...
WAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
JCP
2008
13 years 7 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...