Buscar
Mostrando ítems 1-10 de 1560
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 ...
Dynamic Similarity Search in MultiMetric Spaces
(2006-10-26)
An important research issue in multimedia databases is the
retrieval of similar objects. For most applications in multimedia
databases, an exact search is not meaningful. Thus,
much effort has been devoted to develop ...
DBM*-Tree: An efficient metric acces method
(Scopus, 2007)
In this paper we propose a new dynamic Metric Access Method (MAM) called DBM*-Tree, which uses precomputed distances to reduce the construction cost avoiding repeated calculus of distance. Making use of the pre-calculated ...
THE BRAZILIAN RESEARCH IN INFORMATION METRIC STUDIES: proximity among prominent researchers and related areas
(Univ Federal Campina Grande, 2017-05-01)
This research aims to identify and analyze the prominent Brazilian and international researchers in Information Metric Studies in Brazil, the proximity established among them from the Brazilian researchers' perspectives, ...
Double distance-calculation-pruning for similarity search
(2018-05-17)
Many modern applications deal with complex data, where retrieval by similarity plays an important role. Complex data main comparison mechanisms are based on similarity predicates. They are usually immersed in metric spaces ...
New dynamic metric indices for secondary memory
(Pergamon-Elsevier Science, 2016)
Metric indices support efficient similarity searches in metric spaces. This problem is central to many applications, including multimedia databases and repositories handling complex objects. Most metric indices are designed ...
Scaling functions evaluation for estimation of landscape metrics at higher resolutions
(Elsevier Science, 2014-07)
Understanding the relationship between landscape pattern and environmental processes requires quantification of landscape pattern at multiple scales. This will make it possible to relate broad-scale patterns to fine-scale ...
Analyzing and inferring distance metrics on the particle competition and cooperation algorithm
(2017-01-01)
Machine Learning is an increasing area over the last few years and it is one of the highlights in Artificial Intelligence area. Nowadays, one of the most studied areas is Semi-supervised learning, mainly due to its ...
Solving Multiple Queries through a Permutation Index in GPU
(Revista Computación y Sistemas; Vol. 17 No.3, 2013-09-11)
Abstract. Query-by-content by means of similarity
search is a fundamental operation for applications that
deal with multimedia data. For this kind of query
it is meaningless to look for elements exactly equal
to the ...