Cover Image

ReeSPOT: Reeb Graph Models Semantic Patterns of Normalcy in Human Trajectories

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Bowen, Shailja, S., Gudavalli, Chandrakanth, Levenson, Connor, Khan, Amil, Manjunath, B. S.
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Engineering, Finance, and Science Social and Information Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Markovian Reeb Graphs for Simulating Spatiotemporal Patterns of Life
by: Subrahmanya, Anantajit, et al.
Published: (2025)

ReeFRAME: Reeb Graph based Trajectory Analysis Framework to Capture Top-Down and Bottom-Up Patterns of Life
by: Gudavalli, Chandrakanth, et al.
Published: (2024)

Controlling the Spread of Epidemics on Networks with Differential Privacy
by: Nguyen, Dung, et al.
Published: (2025)

A Linear Time Quantum Algorithm for Pairwise Sequence Alignment
by: Khan, Md. Rabiul Islam, et al.
Published: (2023)

Online Vehicle Routing with Pickups and Deliveries under Time-Dependent Travel-Time Constraints
by: Kontogiannis, Spyros, et al.
Published: (2024)

Planning For Edge Failure in Fixed-Charge Flow Networks
by: Olson, Daniel, et al.
Published: (2024)

Btrim: A fast, lightweight adapter and quality trimming program for next-generation sequencing technologies
by: Kong, Yong
Published: (2014)

Rapid GPU-Based Pangenome Graph Layout
by: Li, Jiajie, et al.
Published: (2024)

GPS-MTM: Capturing Pattern of Normalcy in GPS-Trajectories with self-supervised learning
by: Garg, Umang, et al.
Published: (2025)

Fast multiplication of random dense matrices with fixed sparse matrices
by: Liang, Tianyu, et al.
Published: (2023)

An Algorithm for Optimal Partitioning of Data on an Interval
by: Jackson, Brad, et al.
Published: (2003)

Graph Reconstruction from Noisy Random Subgraphs
by: McGregor, Andrew, et al.
Published: (2024)

Quantum Speedups for Derivative Pricing Beyond Black-Scholes
by: Herman, Dylan, et al.
Published: (2026)

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
by: Wang, Ziao, et al.
Published: (2022)

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
by: Wang, Ziao, et al.
Published: (2023)

Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Sensitivity-Aware Density Estimation in Multiple Dimensions
by: Boquet-Pujadas, Aleix, et al.
Published: (2025)

Enhanced Graph Pattern Matching
by: Cotumaccio, Nicola
Published: (2024)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
by: Zhang, Tian, et al.
Published: (2026)

Graph Discovery and Source Detection in Temporal Graphs
by: Bals, Ben
Published: (2025)

Counting Patterns in Degenerate Graphs in Constant Space
by: Komarath, Balagopal, et al.
Published: (2025)

Succinct Preferential Attachment Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
by: Xu, Yuexuan, et al.
Published: (2024)

An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
by: Chattopadhyay, Amit, et al.
Published: (2024)

Polynomial time algorithm for optimal stopping with fixed accuracy
by: Goldberg, David A., et al.
Published: (2018)

Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)

Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs
by: Ruszil, Jakub, et al.
Published: (2026)

Optimizing Probabilistic Propagation in Graphs by Adding Edges
by: Bhaskara, Aditya, et al.
Published: (2024)

On the External Validity of Average-Case Analyses of Graph Algorithms
by: Bläsius, Thomas, et al.
Published: (2022)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
by: You, Fangchen
Published: (2025)

Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
by: Nakamura, Kengo, et al.
Published: (2026)

Locally Differentially Private Graph Clustering via the Power Iteration Method
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
by: Brandt-Tumescheit, Fabian, et al.
Published: (2024)

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
by: Lee, Seoyong, et al.
Published: (2026)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
by: Csikós, Mónika, et al.
Published: (2023)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)

Multilevel Digital Contact Tracing
by: Mahapatra, Gautam, et al.
Published: (2020)