446 search results - page 61 / 90 » A fast algorithm for computing steiner edge connectivity |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We present an algorithm which can track the 3D pose of a hand held camera in real-time using predefined models of objects in the scene. The technique utilises and extends recently...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Blind image deconvolution is an ill-posed problem that requires regularization to solve. However, many common forms of image prior used in this setting have a major drawback in th...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...