Výsledky vyhledávání - Sub-quadratic algorithm

  1. 1

    Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time Autor Chakraborty, Diptarka, Das, Debarati, Goldenberg, Elazar, Koucky, Michal, Saks, Michael

    ISSN: 2575-8454
    Vydáno: IEEE 01.10.2018
    “… The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratic time…”
    Získat plný text
    Konferenční příspěvek
  2. 2
  3. 3

    A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation Autor Pensia, Ankit

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 07.03.2024
    Vydáno v arXiv.org (07.03.2024)
    “… Specifically, the algorithm observes a \emph{corrupted} set of samples from \(\mathcal{N}(\mu,\mathbf{I}_d)\), where the unknown mean…”
    Získat plný text
    Paper
  4. 4

    Approximate Counting for Spin Systems in Sub-Quadratic Time Autor Anand, Konrad, Feng, Weiming, Freifeld, Graham, Guo, Heng, Wang, Jiaheng

    ISSN: 2751-4838, 2751-4838
    Vydáno: 13.01.2025
    Vydáno v TheoretiCS (13.01.2025)
    “…})$. Our first algorithm does not require this property and extends the range where sub-quadratic algorithms exist…”
    Získat plný text
    Journal Article
  5. 5

    A sub-quadratic algorithm for the longest common increasing subsequence problem Autor Duraj, Lech

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 29.01.2020
    Vydáno v arXiv.org (29.01.2020)
    “… Hence, a natural question arises: does any (slightly) sub-quadratic algorithm exist for the Longest Common Increasing Subsequence problem…”
    Získat plný text
    Paper
  6. 6

    An old sub-quadratic algorithm for finding extremal sets Autor PRITCHARD, P

    ISSN: 0020-0190, 1872-6119
    Vydáno: Amsterdam Elsevier Science 27.06.1997
    Vydáno v Information processing letters (27.06.1997)
    “… sets. This is lower than the only previously known sub-quadratic worst-case upper bound for this problem…”
    Získat plný text
    Journal Article
  7. 7

    An old sub-quadratic algorithm for rinding extremal sets Autor Pritchard, Paul

    ISSN: 0020-0190, 1872-6119
    Vydáno: Elsevier B.V 01.06.1997
    Vydáno v Information processing letters (01.06.1997)
    “… sets. This is lower than the only previously known sub-quadratic worst-case upper bound for this problem…”
    Získat plný text
    Journal Article
  8. 8

    A simple sub-quadratic algorithm for computing the subset partial order Autor Pritchard, Paul

    ISSN: 0020-0190, 1872-6119
    Vydáno: Amsterdam Elsevier B.V 22.12.1995
    Vydáno v Information processing letters (22.12.1995)
    “… it. Algorithms have recently been presented that compute the partial order (and thereby the minimal and maximal sets, i.e., extremal sets…”
    Získat plný text
    Journal Article
  9. 9

    Sub-Quadratic Decoding of One-Point Hermitian Codes Autor Nielsen, Johan S. R., Beelen, Peter

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York IEEE 01.06.2015
    “…We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes…”
    Získat plný text
    Journal Article
  10. 10

    A Sub-Quadratic Exact Medoid Algorithm Autor Newling, James, Fleuret, François

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 12.04.2017
    Vydáno v arXiv.org (12.04.2017)
    “… elements. The algorithm is shown to have, under certain assumptions, expected run time O(N^(3/2)) in R^d where N is the set size, making it the first sub-quadratic exact medoid algorithm for d>1…”
    Získat plný text
    Paper
  11. 11

    A hybrid layout algorithm for sub-quadratic multidimensional scaling Autor Morrison, A., Ross, G., Chalmers, M.

    ISBN: 9780769517513, 076951751X
    ISSN: 1522-404X
    Vydáno: IEEE 2002
    “… Our algorithm runs in O(N/spl radic/N) and executes significantly faster than Chalmers' 1996 algorithm, whilst producing superior layouts…”
    Získat plný text
    Konferenční příspěvek
  12. 12
  13. 13
  14. 14

    An exact, cache-localized algorithm for the sub-quadratic convolution of hypercubes Autor Serang, Oliver

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 31.07.2016
    Vydáno v arXiv.org (31.07.2016)
    “…; however, when the dimensionality is large, these algorithms become more challenging. A method is proposed for performing exact hypercube convolution in sub-quadratic time…”
    Získat plný text
    Paper
  15. 15

    Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem Autor Drinkwater, Benjamin, Charleston, Michael A.

    ISSN: 1748-7188, 1748-7188
    Vydáno: London BioMed Central 21.05.2016
    Vydáno v Algorithms for molecular biology (21.05.2016)
    “… coevolutionary analysis techniques. This model gives rise to a sub quadratic running time solution for the dated tree reconciliation problem for selected tree topologies, and is shown…”
    Získat plný text
    Journal Article
  16. 16

    Completing gene trees without species trees in sub-quadratic time Autor Mai, Uyen, Mirarab, Siavash

    ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811
    Vydáno: England Oxford University Press 04.03.2022
    Vydáno v Bioinformatics (04.03.2022)
    “…Abstract Motivation As genome-wide reconstruction of phylogenetic trees becomes more widespread, limitations of available data are being appreciated more than…”
    Získat plný text
    Journal Article
  17. 17

    Variational quantum approximate support vector machine with inference transfer Autor Park, Siheon, Park, Daniel K., Rhee, June-Koo Kevin

    ISSN: 2045-2322, 2045-2322
    Vydáno: London Nature Publishing Group UK 25.02.2023
    Vydáno v Scientific reports (25.02.2023)
    “… We propose a Variational Quantum Approximate Support Vector Machine (VQASVM) algorithm that demonstrates empirical sub-quadratic run-time complexity with quantum operations feasible even in NISQ computers…”
    Získat plný text
    Journal Article
  18. 18

    Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs Autor Bringmann, Karl, Kisfaludi-Bak, Sándor, Künnemann, Marvin, Nusser, André, Parsaeian, Zahra

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 10.03.2022
    Vydáno v arXiv.org (10.03.2022)
    “… [Chan and Skrepetos 2019], but it is not at all clear if these algorithms are optimal, especially since in the related class of planar graphs the diameter can be computed…”
    Získat plný text
    Paper
  19. 19

    Tensor-structured algorithm for reduced-order scaling large-scale Kohn–Sham density functional theory calculations Autor Lin, Chih-Chuen, Motamarri, Phani, Gavini, Vikram

    ISSN: 2057-3960, 2057-3960
    Vydáno: London Nature Publishing Group UK 12.04.2021
    Vydáno v npj computational materials (12.04.2021)
    “… Further, the proposed tensor-structured algorithm demonstrated sub-quadratic scaling with system-size for both systems with and without a gap, and involving many thousands of atoms…”
    Získat plný text
    Journal Article
  20. 20

    Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications Autor Rozhon, Vaclav, Elkin, Michael, Grunau, Christoph, Haeupler, Bernhard

    ISSN: 2575-8454
    Vydáno: IEEE 01.10.2022
    “…This paper presents new deterministic and distributed low-diameter decomposition algorithms for weighted graphs…”
    Získat plný text
    Konferenční příspěvek