Zobrazeno 1 - 10
of 333
pro vyhledávání: '"Porat, Ely"'
The quantum approximate optimization algorithm (QAOA) is a leading iterative variational quantum algorithm for heuristically solving combinatorial optimization problems. A large portion of the computational effort in QAOA is spent by the optimization
Externí odkaz:
http://arxiv.org/abs/2208.09888
Autor:
Fried, Dvir, Golan, Shay, Kociumaka, Tomasz, Kopelowitz, Tsvi, Porat, Ely, Starikovskaya, Tatiana
A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses $S$ is the smallest number of edit operations (insertions, deletions, and substitutions) n
Externí odkaz:
http://arxiv.org/abs/2111.02336
For any forest $G = (V, E)$ it is possible to orient the edges $E$ so that no vertex in $V$ has out-degree greater than $1$. This paper considers the incremental edge-orientation problem, in which the edges $E$ arrive over time and the algorithm must
Externí odkaz:
http://arxiv.org/abs/2107.02318
In this work, we revisit the fundamental and well-studied problem of approximate pattern matching under edit distance. Given an integer $k$, a pattern $P$ of length $m$, and a text $T$ of length $n \ge m$, the task is to find substrings of $T$ that a
Externí odkaz:
http://arxiv.org/abs/2106.06037
Filters (such as Bloom Filters) are data structures that speed up network routing and measurement operations by storing a compressed representation of a set. Filters are space efficient, but can make bounded one-sided errors: with tunable probability
Externí odkaz:
http://arxiv.org/abs/2105.10622
In population protocols, the underlying distributed network consists of $n$ nodes (or agents), denoted by $V$, and a scheduler that continuously selects uniformly random pairs of nodes to interact. When two nodes interact, their states are updated by
Externí odkaz:
http://arxiv.org/abs/2011.12633
The shift distance $\mathsf{sh}(S_1,S_2)$ between two strings $S_1$ and $S_2$ of the same length is defined as the minimum Hamming distance between $S_1$ and any rotation (cyclic shift) of $S_2$. We study the problem of sketching the shift distance,
Externí odkaz:
http://arxiv.org/abs/2006.13673
We revisit the $k$-mismatch problem in the streaming model on a pattern of length $m$ and a streaming text of length $n$, both over a size-$\sigma$ alphabet. The current state-of-the-art algorithm for the streaming $k$-mismatch problem, by Clifford e
Externí odkaz:
http://arxiv.org/abs/2004.12881
We revisit a fundamental problem in string matching: given a pattern of length m and a text of length n, both over an alphabet of size $\sigma$, compute the Hamming distance between the pattern and the text at every location. Several $(1+\epsilon)$-a
Externí odkaz:
http://arxiv.org/abs/2001.00211
In the $\{-1,0,1\}$-APSP problem the goal is to compute all-pairs shortest paths (APSP) on a directed graph whose edge weights are all from $\{-1,0,1\}$. In the (min,max)-product problem the input is two $n\times n$ matrices $A$ and $B$, and the goal
Externí odkaz:
http://arxiv.org/abs/1911.06132