20294 search results - page 360 / 4059 » Algorithmic Information Theory |
145
click to vote
CORR
2010
Springer
15 years 7 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 ...
180
click to vote
MFCS
2005
Springer
16 years 10 days 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...
160
click to vote
CVPR
2007
IEEE
16 years 8 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...
178
click to vote
SRDS
1998
IEEE
15 years 11 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...
139
click to vote
SCL
2008
15 years 6 months ago
2008
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions...