PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Selman, Alan L."

Author of the publication

copydeleteadd this publication to your clipboard
Non-mitotic sets.

, , , and . Theor. Comput. Sci., 410 (21-23): 2011-2023 (2009)

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.

L. Ahlgrimm

Lambert Theisen University of Stuttgart

Annika Liebgott

Automated reference-free assessment of MR image quality using an active learning approach: Comparison of Support Vector Machine versus Deep Neural Network classification, , , , , , , and . Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)
Automated reference-free assessment of MR image quality using an active learning approach: Comparison of Support Vector Machine versus Deep Neural Network classification, , , , , , , and . Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)An easy-to-use image labeling platform for automatic Magnetic Resonance Image Quality Assessment, , , , , , and . Proceedings of the IEEE International Symposium on Biomedical Imaging (ISBI), Melbourne, Australia, (April 2017)Automated image quality assessment in whole-body MRI, , , , , , , , and . Proceedings of the Radiological Society of North America (RSNA), Chicago, USA, (November 2016)

Univ. -Prof. Dr. Remco Ingmar Leine University of Stuttgart

Christian León University of Stuttgart

 

Other publications of authors with the same name

Some Observations on NP, Real Numbers and P-Selective Sets.. J. Comput. Syst. Sci., 23 (3): 326-332 (1981)The complexity of unions of disjoint sets., , , and . J. Comput. Syst. Sci., 74 (7): 1173-1187 (2008)P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility., , , and . J. Comput. Syst. Sci., 53 (2): 194-209 (1996)Reductions between disjoint NP-Pairs., , and . Inf. Comput., 200 (2): 247-267 (2005)Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity. Information and Control, 52 (1): 36-51 (January 1982)Promise Problems Complete for Complexity Classes. Inf. Comput., 78 (2): 87-97 (August 1988)Editorial Statement.. Theory Comput. Syst., 34 (1): 1 (2001)Computability and Complexity Theory., and . Texts in Computer Science Springer, (2001)Computability and Complexity Theory, Second Edition., and . Texts in Computer Science Springer, (2011)Complete distributional problems, hard languages, and resource-bounded measure., and . Theor. Comput. Sci., 234 (1-2): 273-286 (2000)