Suchergebnisse - Sub-quadratic algorithm

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

“… The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratic time …”
Volltext

Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 ? and monotone LCP von Huang, Zheng-Hai, Qi, Liqun, Sun, Defeng

Volltext

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

“… Specifically, the algorithm observes a \emph{corrupted} set of samples from \(\mathcal{N}(\mu,\mathbf{I}_d)\), where the unknown mean …”
Volltext

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

“… })$. Our first algorithm does not require this property and extends the range where sub-quadratic algorithms exist …”
Volltext

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

“… Hence, a natural question arises: does any (slightly) sub-quadratic algorithm exist for the Longest Common Increasing Subsequence problem …”
Volltext

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

“… sets. This is lower than the only previously known sub-quadratic worst-case upper bound for this problem …”
Volltext

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

“… sets. This is lower than the only previously known sub-quadratic worst-case upper bound for this problem …”
Volltext

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

“… it. Algorithms have recently been presented that compute the partial order (and thereby the minimal and maximal sets, i.e., extremal sets …”
Volltext

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

“… We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes …”
Volltext

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

“… 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 …”
Volltext

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

“… Our algorithm runs in O(N/spl radic/N) and executes significantly faster than Chalmers' 1996 algorithm, whilst producing superior layouts …”
Volltext

Sub-quadratic convergence of a smoothing Newton algorithm for the P and monotone LCP von Zheng-Hai, Huang, Qi, Liqun, Sun, Defeng

Volltext

Sub-quadratic convergence of a smoothing Newton algorithm for the P0- and monotone LCP von HUANG, Zheng-Hai, LIQUN QI, DEFENG SUN

Volltext

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

“… ; however, when the dimensionality is large, these algorithms become more challenging. A method is proposed for performing exact hypercube convolution in sub-quadratic time …”
Volltext

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

“… 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 …”
Volltext

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

“… Abstract Motivation As genome-wide reconstruction of phylogenetic trees becomes more widespread, limitations of available data are being appreciated more than …”
Volltext

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

“… 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 …”
Volltext

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

“… [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 …”
Volltext

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

“… 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 …”
Volltext

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

“… This paper presents new deterministic and distributed low-diameter decomposition algorithms for weighted graphs …”
Volltext