Zobrazeno 1 - 10
of 20 239
pro vyhledávání: '"Orthogonal vectors"'
We study the average-case version of the Orthogonal Vectors problem, in which one is given as input $n$ vectors from $\{0,1\}^d$ which are chosen randomly so that each coordinate is $1$ independently with probability $p$. Kane and Williams [ITCS 2019
Externí odkaz:
http://arxiv.org/abs/2410.22477
Publikováno v:
IEEE Access, Vol 11, Pp 51018-51031 (2023)
SVD-based watermarking algorithm is one of the most preferable algorithms for copyright protection due to its singular values (SVs) that have outstanding stability and represents intrinsic algebraic image properties. Hence, there is a good trade-off
Externí odkaz:
https://doaj.org/article/23aea284a1cd41e28b3ea87dabd1d508
Autor:
Nederlof, Jesper, Węgrzycki, Karol
We present an $\mathcal{O}^\star(2^{0.5n})$ time and $\mathcal{O}^\star(2^{0.249999n})$ space randomized algorithm for solving worst-case Subset Sum instances with $n$ integers. This is the first improvement over the long-standing $\mathcal{O}^\star(
Externí odkaz:
http://arxiv.org/abs/2010.08576
Autor:
Vitor, Fabio1 (AUTHOR) ftorresvitor@unomaha.edu, Easton, Todd2 (AUTHOR)
Publikováno v:
Computational Optimization & Applications. Sep2022, Vol. 83 Issue 1, p211-246. 36p.
Publikováno v:
Nonlinear Processes in Geophysics, Vol 30, Pp 289-297 (2023)
The space spanned by the background ensemble provides a basis for correcting forecast errors in the ensemble Kalman filter. However, the ensemble space may not fully capture the forecast errors due to the limited ensemble size and systematic model er
Externí odkaz:
https://doaj.org/article/16ed0f333fb94cbc9ab37c626536057e
Fine-grained quantum supremacy is a study of proving (nearly) tight time lower bounds for classical simulations of quantum computing under "fine-grained complexity" assumptions. We show that under conjectures on Orthogonal Vectors (OV), 3-SUM, All-Pa
Externí odkaz:
http://arxiv.org/abs/1902.08382
Autor:
Park, Josiah
An extension is given of a recent result of Glazyrin, showing that an orthonormal basis $\{e_{i}\}_{i=1}^{d}$ joined with the vectors $\{e_{j}\}_{j=1}^{m}$, where $1\leq m < d$ minimizes the $p$-frame potential for $p\in[1,2\log{\frac{2m+1}{2m}}/\log
Externí odkaz:
http://arxiv.org/abs/1902.09443
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.
Publikováno v:
In Pattern Recognition February 2021 110
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.