( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Large Contextual Dataset for Classification, Detection and Counting of Cars with Deep Learning.

, , , и . ECCV (3), том 9907 из Lecture Notes in Computer Science, стр. 785-800. Springer, (2016)

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.

Sivahari Prasad Gorantla

Iwan Goranow

Adamantia Gorantonaki

Bengt Göransson

Goran Reiser

Motivationale Handlungskonflikte beim Lernverhalten: Einsatz und Analyse eines Trainingsprogramms zur Optimierung des Lernprozesses. Uni Bayreuth, (2009)
 

Другие публикации лиц с тем же именем

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem., , и . SODA, стр. 253-259. ACM/SIAM, (1998)Randomized compact routing in decomposable metrics., , , и . PODC, стр. 351-352. ACM, (2011)Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems., , , и . Theor. Comput. Sci., 235 (1): 25-42 (2000)Novel Adversarial Defense Techniques for White-Box Attacks., , , , и . ICMLA, стр. 617-622. IEEE, (2022)Combinational equivalence checking for threshold logic circuits., , и . ACM Great Lakes Symposium on VLSI, стр. 102-107. ACM, (2007)Improved approximations for tour and tree covers., , , и . APPROX, том 1913 из Lecture Notes in Computer Science, стр. 184-193. Springer, (2000)Randomized Postoptimization of Covering Arrays., , и . IWOCA, том 5874 из Lecture Notes in Computer Science, стр. 408-419. Springer, (2009)Algorithms for optimizing production DNA sequencing., , , , и . SODA, стр. 399-408. ACM/SIAM, (2000)Separators in Graphs.. Encyclopedia of Algorithms, Springer, (2008)Budget constrained minimum cost connected medians., , и . J. Discrete Algorithms, 2 (4): 453-469 (2004)