Image de couverture de livre

Optimal Matrix Sketching over Sliding Windows

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yin, Hanyan, Wen, Dongxie, Li, Jiajun, Wei, Zhewei, Zhang, Xiao, Huang, Zengfeng, Li, Feifei
Format:	Preprint
Publié:	2024
Sujets:	Databases Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams
par: Yin, Hanyan, et autres
Publié: (2026)

Matrix Product Sketching via Coordinated Sampling
par: Daliri, Majid, et autres
Publié: (2025)

Optimal Approximate Matrix Multiplication over Sliding Windows
par: Yao, Ziqi, et autres
Publié: (2025)

DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows (Technical Report)
par: Wang, Yiping, et autres
Publié: (2024)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
par: Li, Yi, et autres
Publié: (2024)

Optimal Approximate Matrix Multiplication over Sliding Window
par: Xian, Haoming, et autres
Publié: (2025)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
par: Huang, Zengfeng, et autres
Publié: (2025)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
par: Qi, Yiyan, et autres
Publié: (2024)

Sampling Methods for Inner Product Sketching
par: Daliri, Majid, et autres
Publié: (2023)

Learning-Augmented Frequency Estimation in Sliding Windows
par: Shahout, Rana, et autres
Publié: (2024)

Online Learning with Limited Information in the Sliding Window Model
par: Braverman, Vladimir, et autres
Publié: (2026)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
par: Bessa, Aline, et autres
Publié: (2023)

Dynamic Data Layout Optimization with Worst-case Guarantees
par: Rong, Kexin, et autres
Publié: (2024)

Dynamic data summarization for hierarchical spatial clustering
par: Abduaziz, Kayumov, et autres
Publié: (2024)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
par: Lee, Changyeol, et autres
Publié: (2025)

Learned Static Function Data Structures
par: Hermann, Stefan, et autres
Publié: (2025)

Daisy Bloom Filters
par: Bercea, Ioana O., et autres
Publié: (2022)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
par: De Man, Quinten, et autres
Publié: (2026)

Approaching 100% Confidence in Stream Summary through ReliableSketch
par: Wu, Yuhan, et autres
Publié: (2024)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
par: Li, Xuan, et autres
Publié: (2024)

Learning the Positions in CountSketch
par: Li, Yi, et autres
Publié: (2023)

Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
par: Wen, Dongxie, et autres
Publié: (2024)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
par: Liao, Meihao, et autres
Publié: (2025)

SplineSketch: Even More Accurate Quantiles with Error Guarantees
par: Łukasiewicz, Aleksander, et autres
Publié: (2025)

Optimal Dynamic Parameterized Subset Sampling
par: Gan, Junhao, et autres
Publié: (2024)

Sampling Space-Saving Set Sketches
par: Lee, Homin K., et autres
Publié: (2024)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

Grafite: Taming Adversarial Queries with Optimal Range Filters
par: Costa, Marco, et autres
Publié: (2023)

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
par: Schäfer, Patrick, et autres
Publié: (2022)

Memory-Efficient Sequential Pattern Mining with Hybrid Tries
par: Hosseininasab, Amin, et autres
Publié: (2022)

Retrieval with Learned Similarities
par: Ding, Bailu, et autres
Publié: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
par: Al-Jazzazi, Yousef, et autres
Publié: (2025)

Model-Free Counterfactual Subset Selection at Scale
par: Nguyen, Minh Hieu, et autres
Publié: (2025)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
par: Zandieh, Amir, et autres
Publié: (2025)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
par: Diwan, Haya, et autres
Publié: (2024)

Efficient Computation of Hyper-triangles on Hypergraphs
par: Yin, Haozhe, et autres
Publié: (2025)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
par: Jang, Jihoon, et autres
Publié: (2025)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
par: Hamada, Kou, et autres
Publié: (2024)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
par: Pham, Ninh, et autres
Publié: (2025)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
par: Ning, Baoling, et autres
Publié: (2024)