1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.IR2023
Fast Interactive Search with a Scale-Free Comparison Oracle
Daniyar Chumbalov, Lars Klein, Lucas Maystre +1
A comparison-based search algorithm lets a user find a target item in a database by answering queries of the form, ``Which of items and is closer to ?'' Instead of f…
stat.ML2019★ 1 cited
Scalable and Efficient Comparison-based Search without Features
Daniyar Chumbalov, Lucas Maystre, Matthias Grossglauser
We consider the problem of finding a target object using pairwise comparisons, by asking an oracle questions of the form \emph{"Which object from the pair is more simil…
cs.IT2015
On the Combinatorial Version of the Slepian-Wolf Problem
Daniyar Chumbalov, Andrei Romashchenko
We study the following combinatorial version of the Slepian-Wolf coding scheme. Two isolated Senders are given binary strings and respectively; the length of each string is…