446 search results - page 61 / 90 » A fast algorithm for computing steiner edge connectivity |
120
Voted
GLOBECOM
2006
IEEE
15 years 9 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...
129
Voted
ICPR
2006
IEEE
16 years 4 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...
203
click to vote
CVPR
2011
IEEE
14 years 10 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...
118
Voted
COMPGEOM
2009
ACM
15 years 10 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 ...
192
click to vote
PODC
2011
ACM
14 years 6 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...