ÆÈ·Î¿ì
Daniyar Chumbalov
Daniyar Chumbalov
PhD Student, EPFL
epfl.chÀÇ À̸ÞÀÏ È®ÀεÊ
Á¦¸ñ
Àοë
Àοë
¿¬µµ
Scalable and Efficient Comparison-based Search without Features
D Chumbalov, L Maystre, M Grossglauser
ICML 2020, 2019
6*2019
Randomized polynomial time protocol for combinatorial Slepian-Wolf problem
D Chumbalov, A Romashchenko
International Symposium on Mathematical Foundations of Computer Science, 235-247, 2015
32015
Combinatorial Version of the Slepian–Wolf Coding Theorem for Binary Strings
DA Chumbalov
¬³¬Ú¬Ò¬Ú¬â¬ã¬Ü¬Ú¬Ö ¬ï¬Ý¬Ö¬Ü¬ä¬â¬à¬ß¬ß¬í¬Ö ¬Þ¬Ñ¬ä¬Ö¬Þ¬Ñ¬ä¬Ú¬é¬Ö¬ã¬Ü¬Ú¬Ö ¬Ú¬Ù¬Ó¬Ö¬ã¬ä¬Ú¬ñ 10 (0), 656-665, 2013
32013
On the combinatorial version of the Slepian–Wolf problem
D Chumbalov, A Romashchenko
IEEE Transactions on Information Theory 64 (9), 6054-6069, 2018
22018
Fast Interactive Search with a Scale-Free Comparison Oracle
D Chumbalov, L Klein, L Maystre, M Grossglauser
arXiv preprint arXiv:2306.01814, 2023
2023
Stochastic Models for Comparison-based Search
D Chumbalov
EPFL, 2023
2023
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–6