Suchergebnisse - fast algorithm execution time
-
1
A Mobile Platform for Movement Tracking Based on a Fast-Execution-Time Optical-Flow Algorithm
ISSN: 1549-8328, 1558-0806Veröffentlicht: New York IEEE 01.04.2022Veröffentlicht in IEEE transactions on circuits and systems. I, Regular papers (01.04.2022)“… A multi-purpose mechanical platform to track moving objects in three-dimensional space has been developed. It is composed of one main microcontroller board …”
Volltext
Journal Article -
2
Enhanced self-adaptive differential evolution multi-Objective algorithm for coordination of directional overcurrent relays contemplating maximum and minimum fault points
ISSN: 1751-8687, 1751-8695Veröffentlicht: The Institution of Engineering and Technology 05.11.2019Veröffentlicht in IET generation, transmission & distribution (05.11.2019)“… ; zero violation of coordination constraints in large interconnected network; and low computational resource consumption leading to fast algorithm execution time …”
Volltext
Journal Article -
3
Parallel Metropolis coupled Markov chain Monte Carlo for Bayesian phylogenetic inference
ISSN: 1367-4803, 1460-2059, 1367-4811Veröffentlicht: Oxford Oxford University Press 12.02.2004Veröffentlicht in Bioinformatics (12.02.2004)“… : This paper presents a parallel algorithm for (MC)3. The proposed parallel algorithm retains the ability to explore multiple peaks in the posterior distribution of trees while maintaining a fast execution time …”
Volltext
Journal Article -
4
Efficient Computation for Discrete Fractional Hadamard Transform
ISSN: 1549-8328, 1558-0806Veröffentlicht: New York IEEE 01.10.2024Veröffentlicht in IEEE transactions on circuits and systems. I, Regular papers (01.10.2024)“… Additionally, we compare the execution times with those of existing fast algorithms, and the results show that the proposed algorithm has better performance …”
Volltext
Journal Article -
5
XGANDALF – extended gradient descent algorithm for lattice finding
ISSN: 2053-2733, 2053-2733Veröffentlicht: 5 Abbey Square, Chester, Cheshire CH1 2HU, England International Union of Crystallography 01.09.2019Veröffentlicht in Acta crystallographica. Section A, Foundations and advances (01.09.2019)“… A novel automatic indexing algorithm is presented, which in tests usually gives significantly higher indexing rates than alternative programs currently available for this task …”
Volltext
Journal Article -
6
RecMotif: a novel fast algorithm for weak motif discovery
ISSN: 1471-2105, 1471-2105Veröffentlicht: London BioMed Central 14.12.2010Veröffentlicht in BMC bioinformatics (14.12.2010)“… Previous algorithms that aimed to solve the problem usually require a large amount of memory or execution time …”
Volltext
Journal Article -
7
Fast prototype selection algorithm based on adjacent neighbourhood and boundary approximation
ISSN: 2045-2322, 2045-2322Veröffentlicht: London Nature Publishing Group UK 22.11.2022Veröffentlicht in Scientific reports (22.11.2022)“… The unceasing increase of data quantity severely limits the wide application of mature classification algorithms due to the unacceptable execution time and the insufficient memory …”
Volltext
Journal Article -
8
Fast computation of sample entropy and approximate entropy in biomedicine
ISSN: 0169-2607, 1872-7565, 1872-7565Veröffentlicht: Kidlington Elsevier Ireland Ltd 01.12.2011Veröffentlicht in Computer methods and programs in biomedicine (01.12.2011)“… ) execution time, which is not fast enough for online applications and for applications with long data sets …”
Volltext
Journal Article -
9
Evaluation of Fast Sample Entropy Algorithms on FPGAs: From Performance to Energy Efficiency
ISSN: 1099-4300, 1099-4300Veröffentlicht: Basel MDPI AG 23.08.2022Veröffentlicht in Entropy (Basel, Switzerland) (23.08.2022)“… ) is a practical and common method to estimate time-series complexity. Unfortunately, SampEn is a time-consuming method growing in quadratic times with the number of elements, which makes this method unviable when processing large data series …”
Volltext
Journal Article -
10
Fast Prediction for Criminal Suspects through Neighbor Mutual Information-Based Latent Network
ISSN: 0884-8173, 1098-111XVeröffentlicht: New York Hindawi 2023Veröffentlicht in International journal of intelligent systems (2023)“… Among many machine learning algorithms, network-based approaches are well-suited to reflect these associative characteristics …”
Volltext
Journal Article -
11
A Fast, Parallel Algorithm for Fully Overlapped Allan Variance and Total Variance for Analysis and Modeling of Noise in Inertial Sensors
ISSN: 2475-1472, 2475-1472Veröffentlicht: Piscataway IEEE 01.06.2018Veröffentlicht in IEEE sensors letters (01.06.2018)“… Our key contribution is a fast, parallelizable algorithm (Algorithm 1) to calculate FOAV and TV for generating smooth …”
Volltext
Journal Article -
12
Irreversible demagnetization analysis of RWAFPM motor using modified MEC algorithm
ISSN: 0332-1649, 2054-5606Veröffentlicht: Bradford Emerald Publishing Limited 17.12.2020Veröffentlicht in Compel (17.12.2020)“… Purpose This paper aims to present a modified MEC algorithm for demagnetization modeling of the PM motor …”
Volltext
Journal Article -
13
Fast phase unwrapping algorithm for interferometric applications
ISSN: 0146-9592Veröffentlicht: United States 15.07.2003Veröffentlicht in Optics letters (15.07.2003)“… The execution time for our algorithm is equivalent to the computation time required for performing eight fast Fourier transforms and is stable against noise and residues present in the wrapped phase …”
Weitere Angaben
Journal Article -
14
Fast template match algorithm for spatial object detection using a stereo vision system for autonomous navigation
ISSN: 0263-2241, 1873-412XVeröffentlicht: Elsevier Ltd 01.10.2023Veröffentlicht in Measurement : journal of the International Measurement Confederation (01.10.2023)“… this task is to use disparity maps. The disadvantages of these methods are that they are time consuming with a high computational cost which is not ideal for real-time applications …”
Volltext
Journal Article -
15
Real-Valued Discrete Fractional Hadamard Transform: Fast Algorithms and Implementations
ISSN: 1549-8328, 1558-0806Veröffentlicht: New York IEEE 01.09.2025Veröffentlicht in IEEE transactions on circuits and systems. I, Regular papers (01.09.2025)“… 50.0% and 83.3%, respectively, compared to state-of-the-art fast algorithms. The comparison results show that the RFHT also has lower execution time and power consumption …”
Volltext
Journal Article -
16
Fast Hopping Discrete Sine Transform
ISSN: 2169-3536, 2169-3536Veröffentlicht: Piscataway IEEE 2021Veröffentlicht in IEEE access (2021)“… This is because the discrete sine transform is close to the optimal Karhunen-Loeve transform for first-order Markov stationary signals with low correlation coefficients. Short-time (hopping …”
Volltext
Journal Article -
17
Efficient k-nearest neighbors search in graph space
ISSN: 0167-8655, 1872-7344Veröffentlicht: Amsterdam Elsevier B.V 01.06.2020Veröffentlicht in Pattern recognition letters (01.06.2020)“… •We propose a fast k-nearest neighbor algorithm in graph space.•The algorithm extends a Depth-First algorithm dedicated to solving the graph matching problem …”
Volltext
Journal Article -
18
Investigating execution-characteristics of feature-detection algorithms
ISSN: 1946-0740, 1946-0759, 1946-0759Veröffentlicht: IEEE 01.01.2017Veröffentlicht in 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) (01.01.2017)“… hardware resources and how to improve the time predictability and execution time of such algorithms when executing on multi-core CPUs …”
Volltext
Tagungsbericht Journal Article -
19
A Fast, Partially Parallelizable Algorithm for Predicting Execution Time of EQL Rule-Based Programs
ISBN: 0849324939, 9780849324932ISSN: 0190-3918Veröffentlicht: 1994Veröffentlicht in 1994 International Conference on Parallel Processing Vol. 3 (1994)“… In this paper, we tackle this problem with a fast, partially parallelizable response time analysis algorithm for a class of EQL rule-based programs with constant assignments …”
Volltext
Tagungsbericht -
20
Applying the FastIAS algorithm to the Redlich-Peterson isotherm
ISSN: 0929-5607, 1572-8757Veröffentlicht: New York Springer US 01.06.2025Veröffentlicht in Adsorption : journal of the International Adsorption Society (01.06.2025)“… approximant allowing to perform the calculations with the Fast-IAS algorithm leading to execution times that are slightly slower but comparable to a dual site Langmuir/Fast-IAS combination …”
Volltext
Journal Article

