Results 71 to 80 of about 5,105,361 (177)

Weak Similarities of Finite Ultrametric and Semimetric Spaces

open access: yesp-Adic Numbers, Ultrametric Analysis and Applications, 2018
14 pages, 2 figures.
openaire   +3 more sources

Corrigendum to “An Easy‐to‐Understand Method to Construct Desired Distance‐Like Measures”

open access: yes
Complexity, Volume 2024, Issue 1, 2024.
Wen Qing Fu   +5 more
wiley   +1 more source

Spectral gaps and error estimates for infinite-dimensional Metropolis-Hastings with non-Gaussian priors

open access: yes, 2019
We study a class of Metropolis-Hastings algorithms for target measures that are absolutely continuous with respect to a large class of non-Gaussian prior measures on Banach spaces.
Hosseini, Bamdad, Johndrow, James E
core  

Calibrated simplex-mapping classification. [PDF]

open access: yesPLoS One, 2023
Heese R, Schmid J, Walczak M, Bortz M.
europepmc   +1 more source

Diversities and the Generalized Circumradius. [PDF]

open access: yesDiscrete Comput Geom, 2023
Bryant D   +3 more
europepmc   +1 more source

Characterization of -Semicompleteness via Caristi’s Fixed Point Theorem in Semimetric Spaces [PDF]

open access: yesJournal of Function Spaces, 2018
Introducing the concept of ∑-semicompleteness in semimetric spaces, we extend Caristi’s fixed point theorem to ∑-semicomplete semimetric spaces. Via this extension, we characterize ∑-semicompleteness. We also give generalizations of the Banach contraction principle.
openaire   +3 more sources

Kernel k-Groups via Hartigan's Method. [PDF]

open access: yesIEEE Trans Pattern Anal Mach Intell, 2021
Franca G, Rizzo ML, Vogelstein JT.
europepmc   +1 more source

Quasi-isometry invariance of hyperbolicity in semimetric spaces, digraphs and semigroups

open access: yes, 2021
16 pages, previous version (v1) is split into two parts, this is the first ...
openaire   +2 more sources

The Bird Core for Minimum Cost Spanning Tree problems Revisited: Monotonicity and Additivity Aspects [PDF]

open access: yes
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost
Brânzei, R.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy