Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  quasi-metrics
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Involving w-distances we prove a fixed point theorem of Caristi-type in the realm of (non-necessarily T1) quasi-metric spaces. With the help of this result, a characterization of quasi-metric completeness is obtained. Our approach allows us to retrieve several key examples occurring in various fields of mathematics and computer science and that are modeled as non- T1 quasi-metric spaces. As an application, we deduce a characterization of complete G -metric spaces in terms of a weak version of Caristi’s theorem that involves a G-metric version of w-distances.
2
Content available remote Indexing Schemes for Similarity Search: an Illustrated Paradigm
EN
We suggest a variation of the Hellerstein-Koutsoupias-Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the structure of indexing schemes for similarity-based search and the geometry of similarity workloads. This in particular provides a unified approach to a great variety of schemes used to index into metric spaces and facilitates their transfer to more general similarity measures such as quasi-metrics. We discuss links between performance of indexing schemes and high-dimensional geometry. The concepts and results are illustrated on a very large concrete dataset of peptide fragments equipped with a biologically significant similarity measure.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.