Výsledky vyhledávání - Sub-quadratic algorithm
-
1
Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time
ISSN: 2575-8454Vydáno: IEEE 01.10.2018Vydáno v 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (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
Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 ? and monotone LCP
ISSN: 0025-5610, 1436-4646Vydáno: 01.04.2004Vydáno v Mathematical programming (01.04.2004)Získat plný text
Journal Article -
3
A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 07.03.2024Vydá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
Approximate Counting for Spin Systems in Sub-Quadratic Time
ISSN: 2751-4838, 2751-4838Vydáno: 13.01.2025Vydá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
A sub-quadratic algorithm for the longest common increasing subsequence problem
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 29.01.2020Vydá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
An old sub-quadratic algorithm for finding extremal sets
ISSN: 0020-0190, 1872-6119Vydáno: Amsterdam Elsevier Science 27.06.1997Vydá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
An old sub-quadratic algorithm for rinding extremal sets
ISSN: 0020-0190, 1872-6119Vydáno: Elsevier B.V 01.06.1997Vydá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
A simple sub-quadratic algorithm for computing the subset partial order
ISSN: 0020-0190, 1872-6119Vydáno: Amsterdam Elsevier B.V 22.12.1995Vydá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
Sub-Quadratic Decoding of One-Point Hermitian Codes
ISSN: 0018-9448, 1557-9654Vydáno: New York IEEE 01.06.2015Vydáno v IEEE transactions on information theory (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
A Sub-Quadratic Exact Medoid Algorithm
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 12.04.2017Vydá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
A hybrid layout algorithm for sub-quadratic multidimensional scaling
ISBN: 9780769517513, 076951751XISSN: 1522-404XVydáno: IEEE 2002Vydáno v IEEE Symposium on Information Visualization, 2002. INFOVIS 2002 (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
Sub-quadratic convergence of a smoothing Newton algorithm for the P and monotone LCP
ISSN: 0025-5610, 1436-4646Vydáno: Heidelberg Springer Nature B.V 01.04.2004Vydáno v Mathematical programming (01.04.2004)Získat plný text
Journal Article -
13
Sub-quadratic convergence of a smoothing Newton algorithm for the P0- and monotone LCP
ISSN: 0025-5610Vydáno: Heidelberg Springer 2004Vydáno v Mathematical programming (2004)Získat plný text
Journal Article -
14
An exact, cache-localized algorithm for the sub-quadratic convolution of hypercubes
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 31.07.2016Vydá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
Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem
ISSN: 1748-7188, 1748-7188Vydáno: London BioMed Central 21.05.2016Vydá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
Completing gene trees without species trees in sub-quadratic time
ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811Vydáno: England Oxford University Press 04.03.2022Vydá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
Variational quantum approximate support vector machine with inference transfer
ISSN: 2045-2322, 2045-2322Vydáno: London Nature Publishing Group UK 25.02.2023Vydá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
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 10.03.2022Vydá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
Tensor-structured algorithm for reduced-order scaling large-scale Kohn–Sham density functional theory calculations
ISSN: 2057-3960, 2057-3960Vydáno: London Nature Publishing Group UK 12.04.2021Vydá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
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications
ISSN: 2575-8454Vydáno: IEEE 01.10.2022Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (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

