Image de couverture de livre

Fast and Efficient Matching Algorithm with Deadline Instances

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Song, Zhao, Wang, Weixin, Yin, Chenbo, Yin, Junze
Format:	Preprint
Publié:	2023
Sujets:	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

A Faster $k$-means++ Algorithm
par: Liang, Jiehao, et autres
Publié: (2022)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
par: Hu, Hang, et autres
Publié: (2022)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
par: Gu, Yuzhou, et autres
Publié: (2023)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
par: Alman, Josh, et autres
Publié: (2025)

A Dynamic Low-Rank Fast Gaussian Transform
par: Huang, Baihe, et autres
Publié: (2022)

Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
par: Qin, Yilong, et autres
Publié: (2023)

InstaHide's Sample Complexity When Mixing Two Private Images
par: Huang, Baihe, et autres
Publié: (2020)

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
par: Hayderi, Alexandre, et autres
Publié: (2024)

Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
par: Lechowicz, Adam, et autres
Publié: (2024)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
par: Wang, Jiachen T., et autres
Publié: (2024)

Inner Product Aware Quantization: Provably Fast, Accurate, and Adaptive Algorithms
par: White, Nathan, et autres
Publié: (2026)

Learning-Augmented Online Packet Scheduling with Deadlines
par: Liang, Ya-Chun, et autres
Publié: (2023)

Instance-Optimal Uniformity Testing and Tracking
par: Blanc, Guy, et autres
Publié: (2025)

Efficient and Provable Algorithms for Covariate Shift
par: Adil, Deeksha, et autres
Publié: (2025)

Minimum-Cost Network Flow with Dual Predictions
par: Chen, Zhiyang, et autres
Publié: (2026)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
par: Kannan, Ravindran, et autres
Publié: (2024)

Efficient Algorithms for Verifying Kruskal Rank in Sparse Linear Regression and Related Applications
par: Zhou, Fengqin
Publié: (2025)

An Efficient Matrix Multiplication Algorithm for Accelerating Inference in Binary and Ternary Neural Networks
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Fast EXP3 Algorithms
par: Sato, Ryoma, et autres
Publié: (2025)

The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics
par: Nikoleit, Henri, et autres
Publié: (2026)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
par: Cheng, Kangke, et autres
Publié: (2026)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
par: Vaze, Rahul, et autres
Publié: (2025)

Stochastic Matching via Local Sparsification
par: Ahmadian, Sara, et autres
Publié: (2026)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
par: Dinitz, Michael, et autres
Publié: (2025)

Finite Sample Bounds for Learning with Score Matching
par: Smedira, Devin, et autres
Publié: (2026)

Sharper Bounds for Chebyshev Moment Matching, with Applications
par: Musco, Cameron, et autres
Publié: (2024)

Parsimonious Learning-Augmented Online Metric Matching
par: Shin, Yongho, et autres
Publié: (2026)

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
par: Chen, Peng, et autres
Publié: (2025)

Fast, robust approximate message passing
par: Ivkov, Misha, et autres
Publié: (2024)

Fast and Simple Densest Subgraph with Predictions
par: Bui, Thai, et autres
Publié: (2025)

Fast online node labeling with graph subsampling
par: Huang, Yushen, et autres
Publié: (2025)

Fixed Order Scheduling with Deadlines
par: Berger, Andre, et autres
Publié: (2024)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
par: Burathep, Kunanon, et autres
Publié: (2025)

Fast John Ellipsoid Computation with Differential Privacy Optimization
par: Li, Xiaoyu, et autres
Publié: (2024)

Sublinear Time Quantum Algorithm for Attention Approximation
par: Song, Zhao, et autres
Publié: (2026)

Accelerating Matroid Optimization through Fast Imprecise Oracles
par: Eberle, Franziska, et autres
Publié: (2024)

Fast-MWEM: Private Data Release in Sublinear Time
par: Haris, Themistoklis, et autres
Publié: (2026)

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

Near-Optimal Algorithms for Omniprediction
par: Okoroafor, Princewill, et autres
Publié: (2025)

New Bounds for Kernel Sums via Fast Spherical Embeddings
par: Wagner, Tal
Publié: (2026)