default search action
Jules Vidal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Pierre Guillou, Jules Vidal
, Julien Tierny
Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data - An Algorithm and a Benchmark. IEEE Trans. Vis. Comput. Graph. 30(4): 1897-1915 (2024) - 2023
- [j5]Markus Flatken
VESTEC: Visual Exploration and Sampling Toolkit for Extreme Computing. IEEE Access 11: 87805-87834 (2023) - [j4]Mathieu Pont
Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams). IEEE Trans. Vis. Comput. Graph. 29(2): 1573-1589 (2023) - 2022
- [j3]Mathieu Pont
Wasserstein Distances, Geodesics and Barycenters of Merge Trees. IEEE Trans. Vis. Comput. Graph. 28(1): 291-301 (2022) - [i8]Pierre Guillou, Jules Vidal, Julien Tierny:
Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data - An Algorithm and A Benchmark. CoRR abs/2206.13932 (2022) - [i7]Mathieu Pont, Jules Vidal, Julien Tierny:
Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams). CoRR abs/2207.10960 (2022) - 2021
- [b1]Jules Vidal:
Progressivity in topological data analysis. (Progressivité en analyse topologique de données). Sorbonne University, Paris, France, 2021 - [j2]Jules Vidal
A Progressive Approach to Scalar Field Topology. IEEE Trans. Vis. Comput. Graph. 27(6): 2833-2850 (2021) - [c3]Jules Vidal, Julien Tierny:
Fast Approximation of Persistence Diagrams with Guarantees. LDAV 2021: 1-11 - [c2]Nick Brown
Utilising urgent computing to tackle the spread of mosquito-borne diseases. UrgentHPC@SC 2021: 36-44 - [i6]Mathieu Pont, Jules Vidal, Julie Delon, Julien Tierny:
Wasserstein Distances, Geodesics and Barycenters of Merge Trees. CoRR abs/2107.07789 (2021) - [i5]Jules Vidal, Julien Tierny:
Fast Approximation of Persistence Diagrams with Guarantees. CoRR abs/2108.05766 (2021) - [i4]Nick Brown, Rupert Nash, Piero Poletti, Giorgio Guzzetta, Mattia Manica, Agnese Zardini, Markus Flatken, Jules Vidal, Charles Gueunet, Evgenij Belikov, Julien Tierny, Artur Podobas, Wei Der Chien, Stefano Markidis, Andreas Gerndt:
Utilising urgent computing to tackle the spread of mosquito-borne diseases. CoRR abs/2111.05654 (2021) - 2020
- [j1]Jules Vidal
Progressive Wasserstein Barycenters of Persistence Diagrams. IEEE Trans. Vis. Comput. Graph. 26(1): 151-161 (2020) - [i3]Jules Vidal, Pierre Guillou, Julien Tierny:
A Progressive Approach to Scalar Field Topology. CoRR abs/2007.14766 (2020)
2010 – 2019
- 2019
- [c1]Max Kontak, Jules Vidal, Julien Tierny:
Statistical Parameter Selection for Clustering Persistence Diagrams. UrgentHPC@SC 2019: 7-12 - [i2]Jules Vidal, Joseph Budin, Julien Tierny:
Progressive Wasserstein Barycenters of Persistence Diagrams. CoRR abs/1907.04565 (2019) - [i1]Max Kontak, Jules Vidal, Julien Tierny:
Statistical Parameter Selection for Clustering Persistence Diagrams. CoRR abs/1910.08398 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: