Results 41 to 50 of about 11,417,388 (340)

Tomographic Reconstruction: General Approach to Fast Back-Projection Algorithms

open access: yesMathematics, 2023
Addressing contemporary challenges in computed tomography (CT) demands precise and efficient reconstruction. This necessitates the optimization of CT methods, particularly by improving the algorithmic efficiency of the most computationally demanding ...
Dmitry Polevoy   +6 more
doaj   +1 more source

Fast subsumption algorithms

open access: yes, 1985
Subsumption algorithms are used in resolution oriented theorem proving to eliminate redundant clauses from the search space. In a recent paper, the authors have introduced a new subsumption algorithm DC (Division into Components) which is much more efficient than the standard algorithms. In the present paper two new results are stated.
Gottlob, G, Leitsch, A
openaire   +3 more sources

Automatically Evolving Rule Induction Algorithms [PDF]

open access: yes, 2006
Research in the rule induction algorithm field produced many algorithms in the last 30 years. However, these algorithms are usually obtained from a few basic rule induction algorithms that have been often changed to produce better ones.
Gisele L. Pappa   +3 more
core   +1 more source

Fast gapped-read alignment with Bowtie 2

open access: yesNature Methods, 2012
As the rate of sequencing increases, greater throughput is demanded from read aligners. The full-text minute index is often used to make alignment very fast and memory-efficient, but the approach is ill-suited to finding longer, gapped alignments. Bowtie
Ben Langmead, S. Salzberg
semanticscholar   +1 more source

Fast Algorithms for Online Stochastic Convex Programming [PDF]

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2014
We introduce the online stochastic Convex Programming (CP) problem, a very general version of stochastic online problems which allows arbitrary concave objectives and convex feasibility constraints.
Shipra Agrawal, Nikhil R. Devanur
semanticscholar   +1 more source

Fast greedy triangulation algorithms [PDF]

open access: yesProceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Dickerson   +3 more
openaire   +1 more source

FAST video series

open access: yes, 2014
Produced & directed a series of Families and Schools Together (FAST) videos. FAST has been recognized for its established track record of high retention rates (80%) of parents who are socially marginalized, and across languages, cultures, religion ...
McGorrian, T.   +1 more
core   +4 more sources

A Fast Fractional Difference Algorithm [PDF]

open access: yesSSRN Electronic Journal, 2013
AbstractWe provide a fast algorithm for calculating the fractional difference of a time series. In standard implementations, the calculation speed (number of arithmetic operations) is of order T2, where T is the length of the time series. Our algorithm allows calculation speed of order TlogT.
Jensen, Andreas Noack   +1 more
openaire   +5 more sources

Accurate, fast and stable denoising source separation algorithms [PDF]

open access: yes, 2004
Denoising source separation is a recently introduced framework for building source separation algorithms around denoising procedures. Two developments are reported here.
Harri Valpola   +3 more
core   +1 more source

Accelerated Multisecret Sharing Scheme Using Fast Matrix Spectral Factorization

open access: yesEntropy
In this paper, we propose a novel multisecret sharing (MSS) scheme that integrates a recently developed exponential-speedup matrix spectral factorization algorithm into the construction of paraunitary matrices over finite fields.
Selda Çalkavur   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy