( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Benefits of Learning to Route in Mixture-of-Experts Models.

, , , , , и . EMNLP, стр. 9376-9396. Association for Computational Linguistics, (2023)

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.

Rina Backhaus

Madhusmita Panigrahy

Rina Zuraida

Rina Barkol

Rina Saha

 

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

An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.. LATIN, том 4957 из Lecture Notes in Computer Science, стр. 387-398. Springer, (2008)Hashing, searching, sketching.. Stanford University, USA, (2007)Sparse Cut Projections in Graph Streams., , и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 480-491. Springer, (2009)Debiasing social wisdom., , , и . KDD, стр. 500-508. ACM, (2013)Faster Algorithms for Binary Matrix Factorization., , , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 3551-3559. PMLR, (2019)Recursive Sketches for Modular Deep Learning., , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 2211-2220. PMLR, (2019)On the decidability of accessibility problems (extended abstract)., , , и . STOC, стр. 306-315. ACM, (2000)Estimating Sum by Weighted Sampling., , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 53-64. Springer, (2007)Beyond bloom filters: from approximate membership checks to approximate state machines., , , , и . SIGCOMM, стр. 315-326. ACM, (2006)Representing Graph Metrics with Fewest Edges., , , , и . STACS, том 2607 из Lecture Notes in Computer Science, стр. 355-366. Springer, (2003)