Results 21 to 30 of about 11,417,388 (340)
Multi-parameter m-complementary Golay sequences and transforms [PDF]
Компьютерная оптика, 2018 In this paper, we develop the family of Golay–Rudin–Shapiro (GRS) m-complementary many-parameter sequences and many-parameter Golay transforms. The approach is based on a new generalized iteration generating construction, associated with n unitary many ...
Valeri Labunets +3 more
doaj +1 more source
Fast algorithms for Quadrature by Expansion I: Globally valid expansions [PDF]
Journal of Computational Physics, 2016 The use of integral equation methods for the efficient numerical solution of PDE boundary value problems requires two main tools: quadrature rules for the evaluation of layer potential integral operators with singular kernels, and fast algorithms for ...
Manas Rachh +2 more
semanticscholar +1 more source
FAST—Fast Algorithm for the Scenario Technique
Operations Research, 2014 The scenario approach is a recently introduced method to obtain feasible solutions to chance-constrained optimization problems based on random sampling. It has been noted that the sample complexity of the scenario approach rapidly increases with the number of optimization variables and this may pose a hurdle to its applicability to medium- and large ...
Caré, A., Garatti, S., CAMPI, Marco
openaire +4 more sources
A Fast Bisimulation Algorithm [PDF]
, 2001 In this paper we propose an efficient algorithmic solution to the problem of determining a Bisimulation Relation on a finite structure. Starting from a set-theoretic point of view we propose an algorithm that optimizes the solution to the Relational coarsest Partition problem given by Paige and Tarjan in 1987 and its use in model-checking packages is ...
DOVIER, Agostino +2 more
openaire +3 more sources
Fast, sensitive, and accurate integration of single cell data with Harmony
Nature Methods, 2019 The emerging diversity of single-cell RNA-seq datasets allows for the full transcriptional characterization of cell types across a wide variety of biological and clinical conditions.
I. Korsunsky +8 more
semanticscholar +1 more source
Fast 2D-DCT implementations for VLIW processors [PDF]
, 1999 This paper analyzes various fast 2D-DCT algorithms regarding their suitability for VLIW processors. Operations for truncation or rounding which are usually neglected in proposals for fast algorithms have also been taken into consideration.
C.N. Canagarajah +5 more
core +1 more source
A comparative analysis of gradient boosting algorithms [PDF]
Artificial Intelligence Review, 2019 The family of gradient boosting algorithms has been recently extended with several interesting proposals (i.e. XGBoost, LightGBM and CatBoost) that focus on both speed and accuracy.
Candice Bentéjac +2 more
semanticscholar +1 more source
FAST PARALLEL PERMUTATION ALGORITHMS [PDF]
Parallel Processing Letters, 1995 We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p) log n) and an improved algorithm with run time O(n/p + log n log log (n/p)). Both algorithms require n additional global bits and O(1) local storage per processor.
Hagerup, Torben, Keller, Jörg
openaire +2 more sources
Fast Algorithms for Pseudoarboricity [PDF]
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 2015 The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph.
openaire +1 more source
Practical divide-and-conquer algorithms for polynomial arithmetic [PDF]
, 2011 We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for composition of power series, showing that it can be applied practically to ...
Andrew Novocin +4 more
core +1 more source