Buscar
Mostrando ítems 1-10 de 858
A method for the reduction of the computational cost associated with the implementation of particle-filter-based failure prognostic algorithms
(Elsevier, 2020)
Failure prognostic algorithms require to reduce the computational burden associated with their implementation to ensure real-time performance in embedded systems. In this regard, this paper presents a method that allows ...
Enriching elementary school mathematical learning with the steepest descent algorithm
(MDPI, 2021)
The steepest descent (or ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool is neither taught nor even mentioned ...
Terminal Triangles Centroid Algorithms for Quality Delaunay Triangulation
(Elsevier, 2020)
Two Lepp algorithms for quality Delaunay triangulation are discussed. Firstly a terminal triangles centroid Delaunay algorithm is studied. For each bad quality triangle t, the algorithm uses the longest edge propagating ...
Alternation and Redundancy Analysis of the Intersection Problem
(ASSOC COMPUTING MACHINERY, 2008-03)
The intersection of sorted arrays problem has applications in search engines such as Google.
Previous work has proposed and compared deterministic algorithms for this problem, in an adaptive
analysis based on the encoding ...
Instance-optimal geometric algorithms
(ACM, 2017)
We prove the existence of an algorithmAfor computing 2D or 3D convex hulls that is optimal forevery pointsetin the following sense: for every sequenceσofnpoints and for every algorithmA′in a certain classA,the running time ...
A comparative study of multiobjective computational intelligence algorithms to find the solution to the RWA problem in WDM networks
(Universidad Nacional de Colombia (Sede Medellín). Facultad de Minas., 2015-11-01)
This paper presents a comparative study of multiobjective algorithms to solve the routing and wavelength assignment problem in optical networks. The study evaluates five computational intelligence algorithms, namely: the ...
LZ78 compression in low main memory space
(Springer, 2017)
We present the first algorithms that perform the LZ78 compression of a text of length n over alphabet [1..σ], whose output is z integers, using only O(z lg σ) bits of main memory. The algorithms read the input text from ...
Adaptive computation of the discrete Fréchet distance
(Springer Verlag, 2018)
The discrete Fréchet distance is a measure of similarity between point sequences which
permits to abstract differences of resolution between the two curves, approximating the original Fréchet
distance between curves. ...
An efficient algorithm for approximated self-similarity joins in metric spaces
(Elsevier, 2020)
Similarity join is a key operation in metric databases. It retrieves all pairs of elements that are similar. Solving such a problem usually requires comparing every pair of objects of the datasets, even when indexing and ...