Buscar
Mostrando ítems 1-10 de 2860
Adapting metric indexes for searching in multi-metric spaces
(KLUWER ACADEMIC PUBLISHERS, 2012)
Motion in Melvin Metric (ESP)Motion in Melvin Metric
(Universidad Nacional de Costa Rica, 2016)
Should phylogenetic and functional diversity metrics compose macroinvertebrate multimetric indices for stream biomonitoring?
(Springer, 2015-02-01)
The idea behind multimetric indices is to integrate information from several metrics to provide a general classification of water bodies without losing the particularities of each individual metric. Historically, multimetric ...
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 ...
Observando el informe “Índice h de las revistas científicas españolas según Google Scholar Metrics”: el caso de las revistas de arte
(2021)
This article reflects on the annual report prepared by the research group EC3 (Evaluation of Science and Scientific Communication), of the University of Granada, entitled " H-index of Spanish scientific journals according ...
Quality of experience in mobile applications: A systematic mapping of metrics and tools
(International Association of Online Engineering, 2020-05)
Context: Quality of Experience (QoE) enables the description of user perceptions about the performance of a particular application or service. In the mobile computing context, it is an important measure for service providers ...
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 ...
Fully dynamic metric access methods based on hyperplane partitioning
(PERGAMON-ELSEVIER SCIENCE LTD, 2011-06)
Metric access methods based on hyperplane partitioning have the advantage, compared to the ball partitioning-based ones, that regions do not overlap. The price is less flexibility for controlling the tree shape, especially ...