Join Our Newsletter

TSMC

2010

5 years 5 days ago
2010

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...

AAECC

2011

Springer

5 years 16 days ago
2011

Springer

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...

CVPR

2010

IEEE

5 years 3 months ago
2010

IEEE

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...

JUCS

2002

5 years 5 months ago
2002

: 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...

ALGORITHMICA

2002

5 years 5 months ago
2002

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,...

TNN

2008

5 years 5 months ago
2008

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...

IPL

2008

5 years 5 months ago
2008

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...

COMBINATORICS

2006

5 years 5 months ago
2006

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...

CORR

2008

Springer

5 years 5 months ago
2008

Springer

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...

CORR

2008

Springer

5 years 5 months ago
2008

Springer

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...