Suchergebnisse - routine (Algorithm OR Algorithms)

Algorithm xxx --- ORTHPOL: A package of routines for generating orthogonal polynomials and Gauss-type quadrature rules von Gautschi, Walter

Inhaltsangabe: “… . The object of these routines is to produce the coefficients in the three-term recurrence relation satisfied …”
Volltext

Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs von Borowitz, Jannick, Großmann, Ernestine, Schulz, Christian

Inhaltsangabe: “… preprocessing routine that exploits the close relation of 2-packing sets to independent sets. This makes well …”
Volltext

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs von Großmann, Ernestine, Schulz, Christian, Strash, Darren, Wagner, Antonie

Inhaltsangabe: “… for this problem. Our reduction routine can serve as a preprocessing step for any solver. We analyze the impact …”
Volltext

An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time von Henzinger, Monika, Münk, Robin, Räcke, Harald

Inhaltsangabe: “… for achieving a near-linear running time is a new partitioning routine that, unlike previous such routines …”
Volltext

An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination von Papadopoulos, Kleitos

Inhaltsangabe: “… )$ time and $O(n^3)$ space on an $n$-vertex graph. Combining this routine with the same peel-one-ball …”
Volltext

Engineering Weighted Connectivity Augmentation Algorithms von Faraj, Marcelo Fonseca, Großmann, Ernestine, Joos, Felix, Möller, Thomas, Schulz, Christian

Inhaltsangabe: “… an ILP formulation with efficient cut enumeration as well as a fast initialization routine. We …”
Volltext

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion von Houari-Durand, Séhane Bel, Eiben, Eduard, Wahlström, Magnus

Inhaltsangabe: “… '$ whose size and parameter value are bounded polynomially in $k$? Although such routines are known …”
Volltext

A simpler QPTAS for scheduling jobs with precedence constraints von Das, Syamantak, Wiese, Andreas

Inhaltsangabe: “… set of guessed subintervals, and fill in the remaining jobs with greedy routines. We believe …”
Volltext

The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof von Addanki, Vamsi, Dallot, Julien, Kellerhals, Leon, Pacut, Maciej, Schmid, Stefan

Inhaltsangabe: “… and involves a lengthy matching routine along with multiple intermediary results. This note presents a …”
Volltext

Faster Linear-Size And-Or Path and Adder Circuits von Brenner, Ulrich, Silvanus, Anna

Inhaltsangabe: “… \log_2 \log_2 n)$. Our core routine is a new algorithm for the construction of a circuit for a single …”
Volltext

Improved Algorithms for Clustering with Noisy Distance Oracles von Pradhan, Pinki, Bhattacharya, Anup, Jaiswal, Ragesh

Inhaltsangabe: “… is routinely used to solve $k$-means in settings where complete distance information is available. One …”
Volltext

An efficient heuristic for approximate maximum flow computations von Qian, Jingyun, Hahn, Georg

Inhaltsangabe: “… Several concepts borrowed from graph theory are routinely used to better understand the inner …”
Volltext

Masked Matrix Multiplication for Emergent Sparsity von Wheatman, Brian, Madhyastha, Meghana, Burns, Randal

Inhaltsangabe: “… compared with Intel MKL's dense or sparse matrix multiply routines. Benefits can be as large as 2 times …”
Volltext

Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra von Wang, Samson, McArdle, Sam, Berta, Mario

Inhaltsangabe: “… of Hamiltonians. As a concrete application, we combine these sub-routines to present a scheme for calculating …”
Volltext

Replicable Clustering von Esfandiari, Hossein, Karbasi, Amin, Mirrokni, Vahab, Velegkas, Grigoris, Zhou, Felix

Inhaltsangabe: “… , statistical $k$-means, and statistical $k$-centers problems by utilizing approximation routines …”
Volltext

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search von Zhang, Tian, Padaki, Ashwin, Liang, Jiaming, Ives, Zack, Waingarten, Erik

Inhaltsangabe: “… , an efficient post-hoc routine, based on DiskANN's pruning step, to adjust the $α$ parameter without …”
Volltext

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization von Su, Yuexin, Zhang, Chenyi, Huang, Peiyuan, Li, Tongyang, Ye, Yinyu

Inhaltsangabe: “… points using only first-order information by integrating a gradient-based negative-curvature routine …”
Volltext

Path Contraction Faster than $2^n$ von Agrawal, Akanksha, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, Tale, Prafullkumar

Inhaltsangabe: “… for it that runs in time $1.88^n\cdot n^{\mathcal{O}(1)}$. The above algorithm is used as a sub-routine in our …”
Volltext

The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks von Abbe, Emmanuel, Boix-Adsera, Enric, Misiakiewicz, Theodor

Inhaltsangabe: “… is of interest since it is poorly understood how neural networks routinely tackle high-dimensional datasets …”
Volltext

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs von Jennings, David, Lostaglio, Matteo, Pallister, Sam, Sornborger, Andrew T, Subaşı, Yiğit

Inhaltsangabe: “… classical precomputations; randomized routines are sampled over optimized random variables; circuit …”
Volltext