( en | de | ru )

 

Disambiguation of "Albrecht, Andreas Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Bounded-depth threshold circuits for computer-assisted CT image classification.

, , , , and . Artif. Intell. Medicine, 24 (2): 179-192 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Albrecht

Alexander Albrecht

Alexander Albrecht

Alexander Albrecht

Alexander Albrecht

 

Other publications of authors with the same name

On Hardware Algorithms for Geometrical Computation Problems.. IFIP Congress, page 989-994. North-Holland/IFIP, (1986)A local search method for pattern classification., , , , and . ESANN, page 1-6. (2001)Robust Signature Discovery for Affymetrix GeneChip® Cancer Classification., , and . ICAART (Revised Selected Papers), volume 8946 of Lecture Notes in Computer Science, page 329-345. Springer, (2014)A Framework for High-throughput Gene Signatures with Microarray-based Brain Cancer Gene Expression Profiling Data., , and . ICAART (1), page 211-220. SciTePress, (2014)Approximating the set of local minima in partial RNA folding landscapes., and . Bioinform., 28 (4): 523-530 (2012)Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems., , and . CIAC, volume 1767 of Lecture Notes in Computer Science, page 277-290. Springer, (2000)Optimal Placements of Flexible Objects: An Adaptive Simulated Annealing Approach., , , and . PPSN, volume 1498 of Lecture Notes in Computer Science, page 968-977. Springer, (1998)On simulaneous realizations of Boolean functions, with applications.. Parcella, volume 342 of Lecture Notes in Computer Science, page 51-56. Springer, (1988)LSA-based Landscape Analysis for Multicast Routing., , , and . SGAI Conf., page 187-200. Springer, (2006)On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains.. GECCO (1), volume 3102 of Lecture Notes in Computer Science, page 642-653. Springer, (2004)