Zobrazeno 1 - 10
of 6 295
pro vyhledávání: '"Streaming algorithms"'
We study learning-augmented streaming algorithms for estimating the value of MAX-CUT in a graph. In the classical streaming model, while a $1/2$-approximation for estimating the value of MAX-CUT can be trivially achieved with $O(1)$ words of space, K
Externí odkaz:
http://arxiv.org/abs/2412.09773
We explore the use of local algorithms in the design of streaming algorithms for the Maximum Directed Cut problem. Specifically, building on the local algorithm of Buchbinder et al. (FOCS'12) and Censor-Hillel et al. (ALGOSENSORS'17), we develop stre
Externí odkaz:
http://arxiv.org/abs/2411.18829
Publikováno v:
ICML2021
This paper studies two variants of the best arm identification (BAI) problem under the streaming model, where we have a stream of $n$ arms with reward distributions supported on $[0,1]$ with unknown means. The arms in the stream are arriving one by o
Externí odkaz:
http://arxiv.org/abs/2410.17835
In this paper, we study streaming algorithms that minimize the number of changes made to their internal state (i.e., memory contents). While the design of streaming algorithms typically focuses on minimizing space and update time, these metrics fail
Externí odkaz:
http://arxiv.org/abs/2406.06821
Autor:
HASSIDIM, AVINATAN1 avinatan@google.com, KAPLAN, HAIM2 haimk@tau.ac.il, MANSOUR, YISHAY2 mansour.yishay@gmail.com, MATIAS, YOSSI3 u@uri.co.il, STEMMER, URI2
Publikováno v:
Journal of the ACM. Nov2022, Vol. 69 Issue 6, p1-14. 14p.
DBSCAN is a popular density-based clustering algorithm that has many different applications in practice. However, the running time of DBSCAN in high-dimensional space or general metric space ({\em e.g.,} clustering a set of texts by using edit distan
Externí odkaz:
http://arxiv.org/abs/2405.06899
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We study the $k$-connectivity augmentation problem ($k$-CAP) in the single-pass streaming model. Given a $(k-1)$-edge connected graph $G=(V,E)$ that is stored in memory, and a stream of weighted edges $L$ with weights in $\{0,1,\dots,W\}$, the goal i
Externí odkaz:
http://arxiv.org/abs/2402.10806