2219 search results - page 162 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
141
Voted
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
143
click to vote
RSA
2008
15 years 4 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
136
click to vote
FOCS
1992
IEEE
15 years 8 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
140
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
128
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...