1159 search results - page 21 / 232 » Binary Decision Graphs |
JSYML
2010
13 years 3 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
ICC
2009
IEEE
13 years 6 months ago
2009
IEEE
A discrete (binary-input 2q -ary output) communication channel with memory is introduced with the objective to judiciously capture both the statistical memory and the soft-decision...
EJC
2007
13 years 9 months ago
2007
We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m, n) for 3 ≤ m < n and show that permut...
GD
2008
Springer
13 years 10 months ago
2008
Springer
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...