Naively Sorting Evolving Data is Optimal and Robust
We study comparison sorting in the evolving data model [AKMU11], where the true total
order changes while the sorting algorithm is processing the input. More precisely, each …
order changes while the sorting algorithm is processing the input. More precisely, each …
Interactive learning of a dynamic structure
E Emamjomeh-Zadeh, D Kempe… - Algorithmic …, 2020 - proceedings.mlr.press
We propose a general framework for interactively learning combinatorial structures, such as
(binary or non-binary) classifiers, orderings/rankings of items, or clusterings, when the …
(binary or non-binary) classifiers, orderings/rankings of items, or clusterings, when the …
Optimally sorting evolving data
JJ Besa, WE Devanny, D Eppstein… - arXiv preprint arXiv …, 2018 - arxiv.org
We give optimal sorting algorithms in the evolving data framework, where an algorithm's
input data is changing while the algorithm is executing. In this framework, instead of …
input data is changing while the algorithm is executing. In this framework, instead of …
A Dynamic Model+ BFR Algorithm for Streaming Data Sorting
Streaming data is widely generated in our lives. This has promoted a lot of research on
streaming data mining, such as streaming data clustering and filtering. In our work, we …
streaming data mining, such as streaming data clustering and filtering. In our work, we …