Sciweavers

1159 search results - page 51 / 232
» Binary Decision Graphs
Sort
View
ICPR
2008
IEEE
14 years 10 months ago
A coordinate system for articulated 2D shape point correspondences
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
Adrian Ion, Salvador B. López Mármol...
AAECC
2007
Springer
89views Algorithms» more  AAECC 2007»
14 years 3 months ago
Links Between Discriminating and Identifying Codes in the Binary Hamming Space
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On ) the set of vectors with even (respectively, odd)...
Irène Charon, Gérard D. Cohen, Olivi...
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
14 years 21 days ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
JMIV
2008
214views more  JMIV 2008»
13 years 9 months ago
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backproj...
Kees Joost Batenburg
IJAR
2008
167views more  IJAR 2008»
13 years 9 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman