Sciweavers

Share
TSMC
2010
2 years 11 months ago
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
Wenwu Yu, Guanrong Chen, Ming Cao, Jürgen Kur...
AAECC
2011
Springer
299views Algorithms» more  AAECC 2011»
2 years 11 months ago
The generalized road coloring problem and periodic digraphs
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
G. Budzban, Ph. Feinsilver
CVPR
2010
IEEE
3 years 2 months ago
Common visual pattern discovery via spatially coherent correspondences
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
Hairong Liu, Shuicheng Yan
JUCS
2002
91views more  JUCS 2002»
3 years 4 months ago
Synchronization and Stability of Finite Automata
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
Jarkko Kari
ALGORITHMICA
2002
58views more  ALGORITHMICA 2002»
3 years 4 months ago
Routing Flow Through a Strongly Connected Graph
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
Thomas Erlebach, Torben Hagerup
TNN
2008
90views more  TNN 2008»
3 years 4 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
IPL
2008
90views more  IPL 2008»
3 years 4 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
COMBINATORICS
2006
110views more  COMBINATORICS 2006»
3 years 4 months ago
The Diameter and Laplacian Eigenvalues of Directed Graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
Fan R. K. Chung
CORR
2008
Springer
93views Education» more  CORR 2008»
3 years 4 months ago
Spanning directed trees with many leaves
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
CORR
2008
Springer
112views Education» more  CORR 2008»
3 years 4 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
books