default search action
Discrete Applied Mathematics, Volume 151
Volume 151, Numbers 1-3, 1 October 2005
- Vito Di Gesù, Attila Kuba:
Dedication. 1 - Vito Di Gesù, Attila Kuba:
Preface. 3 - Alberto Apostolico, Valentin E. Brimkov:
Optimal discovery of repetitions in 2D. 5-20 - Elena Barcucci, Andrea Frosini, Simone Rinaldi:
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption. 21-35 - Kees Joost Batenburg:
An evolutionary algorithm for discrete tomography. 36-54 - Bruno M. Carvalho, Gabor T. Herman, T. Yung Kong:
Simultaneous fuzzy segmentation of multiple objects. 55-77 - David Coeurjolly, Isabelle Sivignon, Florent Dupont, Fabien Feschet, Jean-Marc Chassery:
On digital plane preimage structure. 78-92 - Geir Dahl, Truls Flatberg:
Optimization and reconstruction of hv-convex (0, 1)-matrices. 93-105 - Alain Daurat, Maurice Nivat:
Salient and reentrant points of discrete sets. 106-121 - Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli:
Linear segmentation of discrete curves into blurred segments. 122-137 - Fabien Feschet, Laure Tougne:
On the min DSS problem of closed discrete curves. 138-153 - Andrea Frosini, Giulia Simi:
The reconstruction of a subclass of domino tilings from two projections. 154-168 - Yan Gérard, Isabelle Debled-Rennesson, Paul Zimmermann:
An elementary digital plane recognition algorithm. 169-183 - Hstau Y. Liao, Gabor T. Herman:
A coordinate ascent approach to tomographic reconstruction of label images from a few projections. 184-197 - Christophe Lohou, Gilles Bertrand:
A 3D 6-subiteration curve thinning algorithm based on P-simple points. 198-228 - Thomas Schüle, Christoph Schnörr, Stefan Weber, Joachim Hornegger:
Discrete tomography by convex-concave regularization and D.C. programming. 229-243
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.