721 search results - page 53 / 145 » Graphs with Large Obstacle Numbers |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
AGTIVE
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest [15]. A...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
EJC
2007
13 years 9 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
CVPR
2006
IEEE
14 years 11 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...