Image de couverture de livre

Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lyu, Weiran, Sridharamurthy, Raghavendra, Phillips, Jeff M., Wang, Bei
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Comparative Analysis of Merge Trees using Local Tree Edit Distance
par: Sridharamurthy, Raghavendra, et autres
Publié: (2021)

Edit Distance between Merge Trees
par: Sridharamurthy, Raghavendra, et autres
Publié: (2022)

Measure Theoretic Reeb Graphs and Reeb Spaces
par: Wang, Qingsong, et autres
Publié: (2024)

Time-varying Extremum Graphs
par: Das, Somenath, et autres
Publié: (2024)

Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization
par: Yan, Lin, et autres
Publié: (2021)

Locality Sensitive Hashing in Hyperbolic Space
par: Deng, Chengyuan, et autres
Publié: (2026)

Locally Correct Interleavings between Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2025)

No Dimensional Sampling Coresets for Classification
par: Alishahi, Meysam, et autres
Publié: (2024)

Trajectory Minimum Touching Ball
par: Phillips, Jeff M., et autres
Publié: (2025)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
par: Zhou, Yi, et autres
Publié: (2026)

Dimension-Independent Kernel ε-Covers
par: Phillips, Jeff M., et autres
Publié: (2023)

Efficient and Stable Multi-Dimensional Kolmogorov-Smirnov Distance
par: Jacobs, Peter Matthew, et autres
Publié: (2025)

Time‐varying Extremum Graphs
par: Somenath Das, et autres
Publié: (2024)

A Deformation-based Edit Distance for Merge Trees
par: Wetzels, Florian, et autres
Publié: (2022)

Hardness of High-Dimensional Linear Classification
par: Munteanu, Alexander, et autres
Publié: (2026)

Near-Optimal Euclidean Locality-Sensitive Orderings
par: Gao, Zhimeng, et autres
Publié: (2023)

Towards Computing Average Merge Tree Based on the Interleaving Distance
par: Touli, Elena Farahbakhsh, et autres
Publié: (2026)

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
par: Touli, Elena Farahbakhsh, et autres
Publié: (2025)

Harmonic Chain Barcode and Stability
par: Parsa, Salman, et autres
Publié: (2024)

Solution-Hashing Search Based on Layout-Graph Transformation for Unequal Circle Packing
par: Zhou, Jianrong, et autres
Publié: (2024)

Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation
par: Wetzels, Florian, et autres
Publié: (2025)

Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
par: Wetzels, Florian, et autres
Publié: (2025)

Internalized Self-Correction for Large Language Models
par: Upadhyaya, Nishanth, et autres
Publié: (2024)

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
par: Wetzels, Florian, et autres
Publié: (2023)

Computing Planar Convex Hulls with a Promise
par: Aghamolaei, Sepideh, et autres
Publié: (2026)

Rapid and Precise Topological Comparison with Merge Tree Neural Networks
par: Qin, Yu, et autres
Publié: (2024)

Dynamic Locality Sensitive Orderings in Doubling Metrics
par: La, An, et autres
Publié: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

Stable Trajectory Clustering: An Efficient Split and Merge Algorithm
par: Rahmani, Atieh, et autres
Publié: (2025)

Hashing geographical point data using the space-filling H-curve
par: Netay, Igor V.
Publié: (2024)

Optimal Volume-Sensitive Bounds for Polytope Approximation
par: Arya, Sunil, et autres
Publié: (2023)

Multilevel Skeletonization Using Local Separators
par: Bærentzen, J. Andreas, et autres
Publié: (2023)

Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration
par: Li, Mingzhe, et autres
Publié: (2024)

Optimal Area-Sensitive Bounds for Polytope Approximation
par: Arya, Sunil, et autres
Publié: (2023)

Explainable Mapper: Charting LLM Embedding Spaces Using Perturbation-Based Explanation and Verification Agents
par: Yan, Xinyuan, et autres
Publié: (2025)

Critical Point Extraction from Multivariate Functional Approximation
par: Ma, Guanqun, et autres
Publié: (2024)

Tracking Low-Level Cloud Systems with Topology
par: Li, Mingzhe, et autres
Publié: (2025)

TFZ: Topology-Preserving Compression of 2D Symmetric and Asymmetric Second-Order Tensor Fields
par: Gorski, Nathaniel, et autres
Publié: (2025)

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
par: Chambers, Erin Wolf, et autres
Publié: (2024)

Fast Time-Varying Contiguous Cartograms Using Integral Images
par: Molchanov, Vladimir, et autres
Publié: (2026)