
Miniball
 Referenced in 42 articles
[sw05179]
 balls: combinatorial structure and algorithms We develop algorithms for computing the exact smallest enclosing ball ... show that Welzl’s randomized lineartime algorithm for computing the ball spanned...

Ltur
 Referenced in 40 articles
[sw11689]
 LTUR: A simplified linear time unit resolution algorithm for Horn formulae and computer implementation. Testing ... simplified way of deriving a lineartime algorithm avoiding many of the intricacies of previously...

na24
 Referenced in 15 articles
[sw11485]
 Moreau envelope, and presents a new lineartime algorithm, named NEP for NonExpansive Proximal mapping ... existing algorithms: The Lineartime Legendre Transform (LLT) and the Parabolic Envelope (PE) algorithms...

na13
 Referenced in 30 articles
[sw11509]
 fast Legendre transform, the lineartime Legendre transform. An algorithm is proposed for numerical computation ... with a lineartime complexity in arbitrary space dimensions. A corresponding MATLAB package is described...

UPPAAL TIGA
 Referenced in 42 articles
[sw12913]
 respect to reachability and safety properties. Though timed games for long have been known ... truly onthefly algorithms for their analysis. The algorithm we propose [CDFLL05 ... algorithm suggested by Liu & Smolka [LS98] for lineartime modelchecking of finitestate systems...

Datalog LITE
 Referenced in 10 articles
[sw28894]
 deductive query language with a lineartime modelchecking algorithm, that is, linear time data ... universal quantification in rule bodies. Despite lineartime evaluation, Datalog LITE is highly expressive ... guarded fixedpoint logic. Consequently, lineartime model checking algorithms for all mentioned logics ... inexpressibility proofs to the effect that lineartime fragments of extit{stratified} Datalog have...

Hornlog
 Referenced in 6 articles
[sw21362]
 graph rewriting and on a lineartime algorithm for showing the unsatisfiability of ground Horn...

heapsort
 Referenced in 61 articles
[sw34903]
 science, heapsort is a comparisonbased sorting algorithm. Heapsort can be thought ... does not waste time with a lineartime scan of the unsorted region; rather, heap ... runtime. Heapsort is an inplace algorithm, but it is not a stable sort. Heapsort...

TxT
 Referenced in 1 article
[sw07679]
 lineartime algorithm for reconciliation of nonbinary gene tree and binary species tree Tree ... binary. We present the first lineartime algorithm that outputs a reconciliation...

Superbubble
 Referenced in 1 article
[sw29693]
 that play an essential role in assembly algorithms for highthroughput sequencing data. They ... entrance and a single exit vertex. Lineartime algorithms for the enumeration superbubbles recently have ... superbubble. Here, we describe a lineartime algorithm to determine suitable roots...

MedianOfNinthers
 Referenced in 4 articles
[sw32520]
 learning, finance, biology, and graphics. The selection algorithm Median of Medians, although a landmark theoretical ... this paper is a fast lineartime deterministic selection algorithm MedianOfNinthers based on a refined...

scgwr
 Referenced in 1 article
[sw28372]
 Scalable GWR: A lineartime algorithm for largescale geographically weighted regression with polynomial kernels ... regression (GWR) algorithms for large samples, none of them achieves the lineartime estimation that ... computation time increases linearly with sample size, whereas conventional GWR algorithms take at most quad...

PedKin
 Referenced in 1 article
[sw34169]
 time exact algorithm and the lineartime approximation algorithms are implemented as PedKin...

GeneTRACE
 Referenced in 1 article
[sw35747]
 paper, we describe GENETRACE, an efficient lineartime algorithm that allows the reconstruction of evolutionary...

FASTSP
 Referenced in 1 article
[sw38911]
 time, and we present FASTSP, a lineartime algorithm for calculating these scores. Even...

ChainSAT
 Referenced in 9 articles
[sw09444]
 other focused algorithms solve large KSAT instances almost surely in linear time ... example, for K = 4 we observe lineartime performance well beyond the recently postulated clustering ... surprise given that by design the algorithm gets trapped into the first local energy minimum...

LTL_to_GBA
 Referenced in 1 article
[sw29245]
 Automata. We formalize lineartime temporal logic (LTL) and the algorithm by Gerth...

BatchBALD
 Referenced in 1 article
[sw33573]
 BatchBALD is a greedy lineartime 1−1eapproximate algorithm amenable to dynamic programming...

SCluster++
 Referenced in 2 articles
[sw29662]
 been little progress in developing fast algorithms for it on arbitrary phylogenetic networks. Results ... developed on the basis of a lineartime transformation from the small version...

biXid
 Referenced in 9 articles
[sw12667]
 data.par We further develop an efficient evaluation algorithm for biXid, consisting of the “parsing” phase ... enough expressiveness and a lineartime performance from experiments with several realistic bidirectional transformations including...