4372 search results - page 118 / 875 » Algorithmic Theories of Everything |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choic...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
This paper addresses the problem of robust optimal multi-view triangulation. We propose an abstract framework, as well as a practical algorithm, which finds the best 3D reconstruc...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
SRDS
1998
IEEE
14 years 1 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...