Tamal K. Dey

is this you? claim profile

∙ 0 followers
The Ohio State University

Persistence of the Conley Index in Combinatorial Dynamical Systems

A combinatorial framework for dynamical systems provides an avenue for c...
03/12/2020 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
An efficient algorithm for 1-dimensional (persistent) path homology

This paper focuses on developing an efficient algorithm for analyzing a ...
01/27/2020 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Road Network Reconstruction from Satellite Images with Machine Learning Supported by Topological Methods

Automatic Extraction of road network from satellite images is a goal tha...
09/15/2019 ∙ by Tamal K. Dey, et al. ∙ 21 ∙ share

read it
Computing Minimal Persistent Cycles: Polynomial and Hard Cases

Persistent cycles, especially the minimal ones, are useful geometric fea...
07/10/2019 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules

The classical persistence algorithm virtually computes the unique decomp...
04/07/2019 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Persistent 1-Cycles: Definition, Computation, and Its Application

Persistence diagrams, which summarize the birth and death of homological...
10/11/2018 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Filtration Simplification for Persistent Homology via Edge Contraction

Persistent homology is a popular data analysis technique that is used to...
10/10/2018 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Computing Height Persistence and Homology Generators in R^3 Efficiently

Recently it has been shown that computing the dimension of the first hom...
07/10/2018 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Graph Reconstruction by Discrete Morse Theory

Recovering hidden graph-like structures from potentially noisy data is a...
03/14/2018 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Computing Bottleneck Distance for 2-D Interval Decomposable Modules

Computation of the interleaving distance between persistence modules is ...
03/07/2018 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Efficient algorithms for computing a minimal homology basis

Efficient computation of shortest cycles which form a homology basis und...
01/21/2018 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Persistent Homology of Morse Decompositions in Combinatorial Dynamics

We investigate combinatorial dynamical systems on simplicial complexes c...
01/19/2018 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it
Temporal Hierarchical Clustering

We study hierarchical clusterings of metric spaces that change over time...
07/31/2017 ∙ by Tamal K. Dey, et al. ∙ 0 ∙ share

read it

Tamal K. Dey

Featured Co-authors

Yusu Wang

Anastasios Sidiropoulos

Mateusz Juda

Tianqi Li

Marian Mrozek

Sayan Mandal

Tomasz Kapela

Michal Lipinski

Jiayuan Wang

Ryan Slechta

Cheng Xin

Persistence of the Conley Index in Combinatorial Dynamical Systems

An efficient algorithm for 1-dimensional (persistent) path homology

Road Network Reconstruction from Satellite Images with Machine Learning Supported by Topological Methods

Computing Minimal Persistent Cycles: Polynomial and Hard Cases

Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules

Persistent 1-Cycles: Definition, Computation, and Its Application

Filtration Simplification for Persistent Homology via Edge Contraction

Computing Height Persistence and Homology Generators in R^3 Efficiently

Graph Reconstruction by Discrete Morse Theory

Computing Bottleneck Distance for 2-D Interval Decomposable Modules

Efficient algorithms for computing a minimal homology basis

Persistent Homology of Morse Decompositions in Combinatorial Dynamics

Temporal Hierarchical Clustering