Buscar
Mostrando ítems 1-10 de 1597
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 ...
Algorithm for Construction of Phylogenetic Trees
(1989)
An algorithm is described for the construction of phylogenetic trees. The algorithm is based on the progressive correction of data along the tree construction. For the correction, the average value of the difference between ...
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 ...
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 ...
A grammar compression algorithm based on induced suffix sorting
(Institute of Electrical and Electronics Engineers Inc., 2018)
We introduce GCIS, a grammar compression algorithm based on the induced suffix sorting algorithm SAIS, presented by Nong et al. in 2009. Our solution builds on the factorization performed by SAIS during suffix sorting. We ...
Performance evaluation of the particle swarm optimization algorithm to unambiguously estimate plasma parameters from incoherent scatter radar signals
(Springer, 2020)
Simultaneously estimating plasma parameters of the ionosphere presents a problem for the incoherent scatter radar
(ISR) technique at altitudes between ~ 130 and ~ 300 km. Different mixtures of ion concentrations and ...
Approximation and parameterized algorithms for geometric independent set with shrinking
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
Consider the Maximum Weight Independent Setproblem for rectangles: given a family ofweighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlappingrectangles. The problem is notoriously hard ...
Integrating cross-correlation and relaxation algorithms for particle tracking velocimetry
(Springer, 2011)
An integrated cross-correlation/relaxation algorithm
for particle tracking velocimetry is presented. The
aim of this integration is to provide a flexible methodology
able to analyze images with different seeding and ...
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 ...
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 ...