Buscar
Mostrando ítems 1-10 de 521
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 ...
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 ...
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 ...
CG-Art: demystifying the anthropocentric bias of artistic creativity
(Taylor & Francis, 2020)
The following aesthetic discussion examines in a philosophical-scientific way the relationship between computation and artistic creativity. Currently, there is a criticism about the possible artistic creativity that an ...
Two-level genetic algorithm for evolving convolutional neural networks for pattern recognition
(IEEE-Inst Electrical Electronics Engineers, 2021)
The aim of Neuroevolution is to nd neural networks and convolutional neural network (CNN)
architectures automatically through evolutionary algorithms. A crucial problem in neuroevolution is search
time, since multiple ...
Editorial Message: Special Issue on Hesitant Fuzzy Linguistic Decision Making: Algorithms, Theory and Applications
(Springer Berlin Heidelberg, 2018)
A simple, efficient, parallelizable algorithm for approximated nearest neighbors
(CEUR-WS, 2018)
The use of the join operator in metric spaces leads to what is
known as a similarity join, where objects of two datasets are paired if they
are somehow similar. We propose an heuristic that solves the 1-NN selfsimilarity ...
Bit-parallel witnesses and their applications to approximate string matching
(SPRINGER, 2005-01)
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM (Myers, 1999), searches for a pattern of length m in a text of length n permitting k differences ...
Computational intelligence in remote sensing: an editorial
(MDPI, 2020)
Computational intelligence is a very active and fruitful research of artificial intelligence with a broad spectrum of applications. Remote sensing data has been a salient field of application of computational intelligence ...