English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Topological Persistence has proven to be a promising framework for dealing with problems concerning shape analysis and comparison. In this contexts, it was originally introduced by taking into account 1-dimensional properties of shapes, modeled by real-valued functions. More recently, Topological Persistence has been generalized to consider multidimensional properties of shapes, coded by vector-valued functions. This extension has led to introduce suitable shape descriptors, named the multidimensional persistence Betti numbers functions, and a distance to compare them, the so-called multidimensional matching distance. In this paper we propose a new computational framework to deal with the multidimensional matching distance. We start by proving some new theoretical results, and then we use them to formulate an algorithm for computing such a distance up to an arbitrary threshold error

A new approximation Algorithm for the Matching Distance in Multidimensional Persistence\ud