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.

 

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

Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting., , , и . ICDCIT, том 3816 из Lecture Notes in Computer Science, стр. 172-183. Springer, (2005)Analysis of Preflow Push Algorithms for Maximum Network Flow., и . FSTTCS, том 338 из Lecture Notes in Computer Science, стр. 30-48. Springer, (1988)On O(N²) Equivalence Algorithm for Fan-Out Free Queries., и . ICDT, том 326 из Lecture Notes in Computer Science, стр. 176-190. Springer, (1988)An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane., , и . Discret. Comput. Geom., 18 (4): 377-383 (1997)Crash Recovery in an Open and Safe Nested Transaction Model., , , и . DEXA, том 1308 из Lecture Notes in Computer Science, стр. 440-451. Springer, (1997)Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems., , , и . CVPR, стр. 1338-1345. IEEE Computer Society, (2014)An Efficient Graph Cut Algorithm for Computer Vision Problems., , , и . ECCV (3), том 6313 из Lecture Notes in Computer Science, стр. 552-565. Springer, (2010)An Inference Algorithm for Multi-label MRF-MAP Problems with Clique Size 100., , , и . ECCV (20), том 12365 из Lecture Notes in Computer Science, стр. 257-274. Springer, (2020)An O(n²) Algorithm for Fan-Out Free Query Optimization., и . FSTTCS, том 287 из Lecture Notes in Computer Science, стр. 242-264. Springer, (1987)Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP Problems., и . CVPR, стр. 1346-1353. IEEE Computer Society, (2014)