From post

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.

 

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

Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge., и . CPM, том 4580 из Lecture Notes in Computer Science, стр. 195-204. Springer, (2007)RENET: A Deep Learning Approach for Extracting Gene-Disease Associations from Literature., , , , и . RECOMB, том 11467 из Lecture Notes in Computer Science, стр. 272-284. Springer, (2019)BioNumQA-BERT: answering biomedical questions using numerical facts with a deep language representation model., , , и . BCB, стр. 57:1-57:6. ACM, (2021)An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees., и . Inf. Process. Lett., 100 (4): 137-144 (2006)Requirement-Based Data Cube Schema Design., , , , , и . CIKM, стр. 162-169. ACM, (1999)On-line Stream Merging with Max Span and Min Coverage., , , и . Theory Comput. Syst., 38 (4): 461-479 (2005)An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees., и . ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 754-765. Springer, (2004)Selecting the k Largest Elements with Parity Tests., и . ISAAC, том 1533 из Lecture Notes in Computer Science, стр. 189-198. Springer, (1998)Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing., , , , , , и . COCOON, том 7936 из Lecture Notes in Computer Science, стр. 506-517. Springer, (2013)Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs., , и . COCOON, том 6196 из Lecture Notes in Computer Science, стр. 100-109. Springer, (2010)