( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Family of Latent Variable Convex Relaxations for IBM Model 2.

, , и . AAAI, стр. 2318-2324. AAAI Press, (2015)

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.

Cliff Brackmann

Klonierung und Charakterisierung von hochaffinen Einzelkettenantikörperfragmenten gegen die NS5B-Polymerase des Hepatitis C-Virus. Uni Düsseldorf, (2010)

Cliff Meesenburg

Alice Clifford

Raphaël Clifford

Cliff Scherer

 

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

Fast algorithms for knapsack via convolution and prediction., , , и . STOC, стр. 1269-1282. ACM, (2018)The Online Set Aggregation Problem., , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 245-259. Springer, (2018)An Empirical Study of Online Packet Scheduling Algorithms., и . SEA, том 9685 из Lecture Notes in Computer Science, стр. 278-293. Springer, (2016)On A Strictly Convex IBM Model 1., , и . EMNLP, стр. 221-226. The Association for Computational Linguistics, (2015)Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks., , и . SPAA, стр. 294-303. ACM, (2015)A Simple Algorithm for Dynamic Carpooling with Recourse., , и . SOSA, стр. 196-201. SIAM, (2025)A Convex Alternative to IBM Model 2., , и . EMNLP, стр. 1574-1583. ACL, (2013)The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract)., , и . IPCO, том 7801 из Lecture Notes in Computer Science, стр. 278-289. Springer, (2013)Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs., , , , и . SODA, стр. 1616-1635. SIAM, (2019)LP decoding corrects a constant fraction of errors., , , , и . ISIT, стр. 68. IEEE, (2004)