Imagen de Portada

Motiflets -- Simple and Accurate Detection of Motifs in Time Series

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Schäfer, Patrick, Leser, Ulf
Formato:	Preprint
Publicado:	2022
Materias:	Machine Learning Artificial Intelligence Databases 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

CLaP -- State Detection from Time Series
por: Ermshaus, Arik, et al.
Publicado: (2025)

Raising the ClaSS of Streaming Time Series Segmentation
por: Ermshaus, Arik, et al.
Publicado: (2023)

Memory-Efficient Sequential Pattern Mining with Hybrid Tries
por: Hosseininasab, Amin, et al.
Publicado: (2022)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
por: Zandieh, Amir, et al.
Publicado: (2025)

Extremely Simple Streaming Forest
por: Xu, Haoyin, et al.
Publicado: (2021)

B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index
por: Tekin, Selim Furkan, et al.
Publicado: (2025)

COL-Trees: Efficient Hierarchical Object Search in Road Networks
por: Abeywickrama, Tenindra, et al.
Publicado: (2026)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
por: Al-Jazzazi, Yousef, et al.
Publicado: (2025)

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
por: Najafi, Mohammad Matin, et al.
Publicado: (2025)

Daisy Bloom Filters
por: Bercea, Ioana O., et al.
Publicado: (2022)

Matrix Product Sketching via Coordinated Sampling
por: Daliri, Majid, et al.
Publicado: (2025)

Dynamic Data Layout Optimization with Worst-case Guarantees
por: Rong, Kexin, et al.
Publicado: (2024)

Dynamic data summarization for hierarchical spatial clustering
por: Abduaziz, Kayumov, et al.
Publicado: (2024)

Optimal Matrix Sketching over Sliding Windows
por: Yin, Hanyan, et al.
Publicado: (2024)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
por: Lee, Changyeol, et al.
Publicado: (2025)

Learned Static Function Data Structures
por: Hermann, Stefan, et al.
Publicado: (2025)

Probabilistic Kernel Function for Fast Angle Testing
por: Lu, Kejing, et al.
Publicado: (2025)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
por: Lu, Kejing, et al.
Publicado: (2024)

Polynomial-Time Approximability of Constrained Reinforcement Learning
por: McMahan, Jeremy
Publicado: (2025)

Efficient Detection of Commutative Factors in Factor Graphs
por: Luttermann, Malte, et al.
Publicado: (2024)

SubGen: Token Generation in Sublinear Time and Memory
por: Zandieh, Amir, et al.
Publicado: (2024)

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions
por: Luttermann, Malte, et al.
Publicado: (2026)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

Simple Analysis of Priority Sampling
por: Daliri, Majid, et al.
Publicado: (2023)

Simple Calibration via Geodesic Kernels
por: Dey, Jayanta, et al.
Publicado: (2022)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
por: Pan, Yunjie, et al.
Publicado: (2024)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
por: Wienöbst, Marcel, et al.
Publicado: (2022)

Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
por: Wienöbst, Marcel, et al.
Publicado: (2025)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
por: Pan, Yunjie, et al.
Publicado: (2025)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
por: Hamada, Kou, et al.
Publicado: (2024)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
por: Yao, Jasper
Publicado: (2025)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
por: de Wynter, Adrian
Publicado: (2020)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
por: Li, Dongyue, et al.
Publicado: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
por: Guan, Xinyu, et al.
Publicado: (2025)

Streaming Attention Approximation via Discrepancy Theory
por: Kochetkova, Ekaterina, et al.
Publicado: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
por: Salemohamed, Omar, et al.
Publicado: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
por: Huisman, Tim, et al.
Publicado: (2024)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
por: Sun, Yiwen, et al.
Publicado: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
por: Pedramfar, Mohammad, et al.
Publicado: (2023)