Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Algorithmica

Search In Journal Title:

Abbravation: Algorithmica

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1002/chin.199746285

Search In DOI:

ISSN

1432-0541

Search In ISSN:
Search In Title Of Papers:

The Compressed Annotation Matrix An Efficient Dat

Authors: JeanDaniel Boissonnat Tamal K Dey Clément Maria
Publish Date: 2015/04/18
Volume: 73, Issue: 3, Pages: 607-619
PDF Link

Abstract

Persistent homology with coefficients in a field mathbb F coincides with the same for cohomology because of duality We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors with the simplices We separate the representation of the simplicial complex from the representation of the cohomology groups and introduce a new data structure for maintaining the annotation matrix which is more compact and reduces substantially the amount of matrix operations In addition we propose a heuristic to simplify further the representation of the cohomology groups and improve both time and space complexities The paper provides a theoretical analysis as well as a detailed experimental study of our implementation and comparison with stateoftheart software for persistent homology and cohomologyThis research is partially supported by the 7th Framework Programme for Research of the European Commission under FETOpen Grant No 255827 CGL Computational Geometry Learning This research is also partially supported by NSF National Science Foundation USA Grants CCF1048983 and CCF1116258

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. On Minimum Sum of Radii and Diameters Clustering
  2. Integer Representation and Counting in the Bit Probe Model
  3. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
  4. New Approximation Algorithms for Minimum Cycle Bases of Graphs
  5. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
  6. Aligning Two Convex Figures to Minimize Area or Perimeter
  7. Introduction for S.I. AofA14
  8. Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
  9. Detecting Regular Visit Patterns
  10. Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
  11. Random Matrices and Codes for the Erasure Channel
  12. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
  13. Optimal Parallel Quantum Query Algorithms
  14. Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges
  15. Maximum Series-Parallel Subgraph
  16. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
  17. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
  18. The Parameterized Complexity of Local Search for TSP, More Refined
  19. Approximating Fixation Probabilities in the Generalized Moran Process
  20. Approximation Algorithms for Scheduling with Reservations
  21. Algorithms for the Homogeneous Set Sandwich Problem
  22. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  23. Computing Minimum Cuts by Randomized Search Heuristics
  24. Constructing Labeling Schemes through Universal Matrices
  25. An Approximation Algorithm for the Minimum Co-Path Set Problem
  26. Scheduling with an Orthogonal Resource Constraint
  27. Approximate Boyer-Moore String Matching for Small Alphabets
  28. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  29. Between Treewidth and Clique-Width
  30. What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
  31. Multi-sided Boundary Labeling
  32. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Search Result: