Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ryan Slechta

dblp:149/9203 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-3641-3072ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 since 2021Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 78% Mathematical optimization · 22%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry
topological data analysis
1.022022
Tracking Dynamical Features via Continuation and Persistence · SoCG 2022
Persistence of the Conley Index in Combinatorial Dynamical Systems · SoCG 2020
Computational geometry › topological data analysis › persistent homology
zigzag persistence
1.022022
Tracking Dynamical Features via Continuation and Persistence · SoCG 2022
Persistence of the Conley Index in Combinatorial Dynamical Systems · SoCG 2020
Mathematical optimization › iterative methods
continuation method
0.612022
Tracking Dynamical Features via Continuation and Persistence · SoCG 2022

Methods — techniques the papers use, named apart from their topics

multivector fields · 1.0conley index · 0.6persistent homology · 0.4
YearPublicationVenuePosition
2022 Tracking Dynamical Features via Continuation and Persistence
abstract
Multivector fields and combinatorial dynamical systems have recently become a subject of interest due to their potential for use in computational methods. In this paper, we develop a method to track an isolated invariant set - a salient feature of a combinatorial dynamical system - across a sequence of multivector fields. This goal is attained by placing the classical notion of the "continuation" of an isolated invariant set in the combinatorial setting. In particular, we give a "Tracking Protocol" that, when given a seed isolated invariant set, finds a canonical continuation of the seed across a sequence of multivector fields. In cases where it is not possible to continue, we show how to use zigzag persistence to track homological features associated with the isolated invariant sets. This construction permits viewing continuation as a special case of persistence.
Tamal K. Dey, Michal Lipinski, Marian Mrozek, Ryan Slechta
SoCG4
2020 Persistence of the Conley Index in Combinatorial Dynamical Systems
abstract
A combinatorial framework for dynamical systems provides an avenue for connecting classical dynamics with data-oriented, algorithmic methods. Combinatorial vector fields introduced by Forman and their recent generalization to multivector fields have provided a starting point for building such a connection. In this work, we strengthen this relationship by placing the Conley index in the persistent homology setting. Conley indices are homological features associated with so-called isolated invariant sets, so a change in the Conley index is a response to perturbation in an underlying multivector field. We show how one can use zigzag persistence to summarize changes to the Conley index, and we develop techniques to capture such changes in the presence of noise. We conclude by developing an algorithm to track features in a changing multivector field.
Tamal K. Dey, Marian Mrozek, Ryan Slechta
SoCG3
2020 Approximating lower-star persistence via 2D combinatorial map simplification
Guillaume Damiand, Eduardo Paluzo-Hidalgo, Ryan Slechta, Rocío González-Díaz
Pattern Recognit. Lett.3
2018 Edge contraction in persistence-generated discrete Morse vector fields
Tamal K. Dey, Ryan Slechta
Comput. Graph.2
2014 Optimizing query execution for variable-aligned length compression of bitmap indices
abstract
Indexing is a fundamental mechanism for efficient data access. Recently, we proposed the Variable-Aligned Length (VAL) bitmap index encoding framework, which generalizes the commonly used word-aligned compression techniques. VAL presented a variable-aligned compression framework, which allows columns of a bitmap to be compressed using different encoding lengths. This flexibility creates a tunable compression that balances the trade-off between space and query processing time. The variable format of VAL presents several unique opportunities for query optimization.
Ryan Slechta, Jason Sawin, Ben McCamish, David Chiu 0001, Guadalupe Canahuate
IDEAS1