Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Préa, Pascal"'
A Robinson space is a dissimilarity space $(X,d)$ on $n$ points for which there exists a compatible order, {\it i.e.} a total order $<$ on $X$ such that $x
Externí odkaz:
http://arxiv.org/abs/2306.08800
Publikováno v:
SIAM Journal on Mathematics of Data Science Volume 5, Issue 1, March 2023 Pages: 201 - 221
Recently, Armstrong, Guzm\'an, and Sing Long (2021), presented an optimal $O(n^2)$ time algorithm for strict circular seriation (called also the recognition of strict quasi-circular Robinson spaces). In this paper, we give a very simple $O(n\log n)$
Externí odkaz:
http://arxiv.org/abs/2205.04694
A Robinson space is a dissimilarity space $(X,d)$ (i.e., a set $X$ of size $n$ and a dissimilarity $d$ on $X$) for which there exists a total order $<$ on $X$ such that $x
Externí odkaz:
http://arxiv.org/abs/2203.12386
Publikováno v:
In Discrete Applied Mathematics 31 May 2021 295:120-133
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Préa, Pascal
Publikováno v:
14-th Scientific Meeting. Classification and Data Analysis Group ( CLADAG 2023)
14-th Scientific Meeting. Classification and Data Analysis Group ( CLADAG 2023), Carla Rampichini; Micheke La Rocca, Sep 2023, Salerne, Italy
14-th Scientific Meeting. Classification and Data Analysis Group ( CLADAG 2023), Carla Rampichini; Micheke La Rocca, Sep 2023, Salerne, Italy
International audience; A dissimilarity d on a set X is said to be Robinson if there exists a total order, said compatible, on X such that x < y < z =⇒ d(x, z) ≥ max{d(x, y), d(y, z)}. Roughly speaking, d is Robinson if the points of X can be rep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3430::19929bc17ec6c25cf77ddbd9364c3242
https://hal.science/hal-04159165/document
https://hal.science/hal-04159165/document
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Préa, Pascal, Brucker, François
Publikováno v:
27èmes Rencopntres de la Société Francophone de Classification
27èmes Rencopntres de la Société Francophone de Classification, Sep 2022, Lyon, France
27èmes Rencopntres de la Société Francophone de Classification, Sep 2022, Lyon, France
International audience; Une dissimilarité D sur un ensemble S est Robinson si il existe un ordre total sur S tel que ∀x, y, z ∈ S, x < y < z =⇒ D(x, z) ≥ max{D(x, y), D(y, z)}. Un tel ordre est dit Robinson ou compatible (avec D). Un PQ-arbr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3430::50b508a8e2e6da62e140816a595da4f5
https://hal.science/hal-03800946
https://hal.science/hal-03800946
Publikováno v:
Journal of Classification. Apr2020, Vol. 37 Issue 1, p203-222. 20p.
Publikováno v:
17th conference of the International Federation of Classification Societies ( IFCS 2022 )
17th conference of the International Federation of Classification Societies ( IFCS 2022 ), Paula Brito, Jul 2022, Porto, Portugal
17th conference of the International Federation of Classification Societies ( IFCS 2022 ), Paula Brito, Jul 2022, Porto, Portugal
International audience; A dissimilarity d on a set S of size n is said to be Robinson if its matrix can be symmetrically permuted so that its elements do not decrease when moving away from the main diagonal along any row or column. Equivalently, S ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3430::01d150d768fd8bc4fcca3f1e8b2efb9f
https://hal.science/hal-04158896/document
https://hal.science/hal-04158896/document