Imagen de Portada

TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Qiu, Ruizhong, Jang, Jun-Gi, Lin, Xiao, Liu, Lihui, Tong, Hanghang
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Towards Efficient Data Structures for Approximate Search with Range Queries
por: Kian, Ladan, et al.
Publicado: (2026)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
por: Fan, Zhuochen, et al.
Publicado: (2024)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
por: Xuan, Wei, et al.
Publicado: (2025)

Prophet Inequalities over Time
por: Abels, Andreas, et al.
Publicado: (2022)

Banana Trees for the Persistence in Time Series Experimentally
por: Ost, Lara, et al.
Publicado: (2024)

MOMENTI: Scalable Motif Mining in Multidimensional Time Series
por: Ceccarello, Matteo, et al.
Publicado: (2025)

Interval-Constrained Bipartite Matching over Time
por: Abels, Andreas, et al.
Publicado: (2024)

Optimal-Time Move Structure Construction
por: Brown, Nathaniel K., et al.
Publicado: (2026)

Lempel-Ziv (LZ77) Factorization in Sublinear Time
por: Kempa, Dominik, et al.
Publicado: (2024)

$(1-ε)$-Approximation of Knapsack in Nearly Quadratic Time
por: Mao, Xiao
Publicado: (2023)

Time-Optimal Directed q-Analysis
por: Windisch, Felix, et al.
Publicado: (2025)

Encodings for Range Minimum Queries over Bounded Alphabets
por: Jo, Seungbum, et al.
Publicado: (2026)

Efficient Leverage Score Sampling for Tensor Train Decomposition
por: Bharadwaj, Vivek, et al.
Publicado: (2024)

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
por: Schäfer, Patrick, et al.
Publicado: (2022)

Efficient Adaptive Data Analysis over Dense Distributions
por: Huh, Joon Suk
Publicado: (2026)

Time Efficient Implementation for Online $k$-server Problem on Trees
por: Khadiev, Kamil, et al.
Publicado: (2024)

Approximating Partition in Near-Linear Time
por: Chen, Lin, et al.
Publicado: (2024)

Weakly Approximating Knapsack in Subquadratic Time
por: Chen, Lin, et al.
Publicado: (2025)

Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time
por: Mao, Xiao, et al.
Publicado: (2026)

Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
por: Mao, Xiao
Publicado: (2023)

An Improved Pseudopolynomial Time Algorithm for Subset Sum
por: Chen, Lin, et al.
Publicado: (2024)

A Nearly Quadratic-Time FPTAS for Knapsack
por: Chen, Lin, et al.
Publicado: (2023)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
por: Gupta, Anupam, et al.
Publicado: (2026)

Quantum Data Structure for Range Minimum Query
por: Wang, Qisheng, et al.
Publicado: (2026)

Dynamically Maintaining the Persistent Homology of Time Series
por: di Montesano, Sebastiano Cultrera, et al.
Publicado: (2023)

Data Structures for Range Sorted Consecutive Occurrence Queries
por: Akram, Waseem, et al.
Publicado: (2024)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
por: Kawase, Yasushi, et al.
Publicado: (2025)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
por: Lindermayr, Alexander, et al.
Publicado: (2026)

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
por: Sanaullah, Ahsan, et al.
Publicado: (2025)

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
por: Liu, Yuxi, et al.
Publicado: (2026)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
por: Blauth, Jannis, et al.
Publicado: (2022)

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time
por: Fischer, Nick, et al.
Publicado: (2024)

A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation
por: Harrison, Brent, et al.
Publicado: (2024)

Online Decision Making with Fairness over Time
por: Chen, Rui, et al.
Publicado: (2022)

Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs
por: Onaka, Ryoma, et al.
Publicado: (2025)

Sorted Range Reporting and Range Minima Queries
por: Akram, Waseem, et al.
Publicado: (2021)

Enabling Fast, Accurate, and Efficient Real-Time Genome Analysis via New Algorithms and Techniques
por: Firtina, Can
Publicado: (2025)

Time-Optimal $k$-Server
por: Frei, Fabian, et al.
Publicado: (2025)

Dynamic Treewidth in Logarithmic Time
por: Korhonen, Tuukka
Publicado: (2025)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
por: Gibbons, Ethan, et al.
Publicado: (2026)