Results 21 to 30 of about 319,625 (266)
Fast algorithm for Morphological Filters [PDF]
Journal of Physics: Conference Series, 2011 In surface metrology, M-system (Mean-line filtering system) and E-system (Envelope filtering system) are two filtering approaches. Although M-system has been the dominant choice and played an important role in manufacturing control, Morphological filters, that evolved from the E-system, are believed to give better results in function prediction of ...
S. Lou, X. Jiang, P.J. Scott
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
A Fast Algorithm for the Discrete Element Method by Contact Force Prediction [Translated]†
KONA Powder and Particle Journal, 2014 The discrete element method (DEM) takes enormous calculation time because it requires a very small time step, one small enough to represent the large frequency in the contact dynamic model.
Chiharu Tokoro +2 more
doaj +1 more source
Fast greedy triangulation algorithms [PDF]
Proceedings 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
The Algorithm and Structure for Digital Normalized Cross-Correlation by Using First-Order Moment
Sensors, 2020 Normalized cross-correlation is an important mathematical tool in digital signal processing. This paper presents a new algorithm and its systolic structure for digital normalized cross-correlation, based on the statistical characteristic of inner-product.
Chao Pan +3 more
doaj +1 more source
An Extended Reweighted
Mathematics, 2021 This paper proposes an effective extended reweighted ℓ1 minimization algorithm (ERMA) to solve the basis pursuit problem minu∈Rn{||u||1:Au=f} in compressed sensing, where A∈Rm×n, m≪n.
Sining Huang, Yupeng Chen, Tiantian Qiao
doaj +1 more source
A Fast Fractional Difference Algorithm [PDF]
SSRN 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
Improved Fast-HotStuff Blockchian Consensus Algorithm [PDF]
Jisuanji gongcheng, 2021 The consensus process of the Fast-HotStuff blockchain consensus algorithm consists of two rounds of voting. When the leader node fails after the first round of voting, the throughput will be greatly reduced.
LI Qinan, XUE Zhihao, ZHANG Xuejun
doaj +1 more source
, 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 +2 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