Move schedules: fast persistence computations in coarse dynamic settings
From MaRDI portal
Publication:6589170
DOI10.1007/S41468-023-00156-3WikidataQ129663497 ScholiaQ129663497MaRDI QIDQ6589170FDOQ6589170
Authors: Matthew Piekenbrock, Jose A. Perea 
Publication date: 19 August 2024
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Computational aspects of data analysis and big data (68T09) Persistent homology and applications, topological data analysis (55N31) Topological data analysis (62R40)
Cites Work
- \textsc{Phat} -- persistent homology algorithms toolbox
- The theory of multidimensional persistence
- Stability of persistence diagrams
- Title not available (Why is that?)
- The nonlinear statistics of high-contrast patches in natural images
- Computing persistent homology
- An output-sensitive algorithm for persistent homology
- Dualities in persistent (co)homology
- On the local behavior of spaces of natural images
- On the distribution of the length of the longest increasing subsequence of random permutations
- Worst-case analysis of a new heuristic for the travelling salesman problem
- On the complexity of crossings in permutations
- Enumerating longest increasing subsequences and patience sorting
- Topological analysis of scalar fields with outliers
- Title not available (Why is that?)
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- An efficient approach for the rank aggregation problem
- Lower bounding edit distances between permutations
- Dynamic graph connectivity in polylogarithmic worst case time
- A linear space algorithm for the LCS problem
- A Klein-bottle-based dictionary for texture representation
- Robust Plane Sweep for Intersecting Segments
- Efficient algorithms for line and curve segment intersection using restricted predicates
- Persistence images: a stable vector representation of persistent homology
- Tracking a generator by persistence
- An efficient representation for filtrations of simplicial complexes
This page was built for publication: Move schedules: fast persistence computations in coarse dynamic settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589170)
