Guardado en:
| Autores principales: | Aden-Ali, Ishaq, Ferhatosmanoglu, Hakan, Greaves-Tunnell, Alexander, Mishra, Nina, Wagner, Tal |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2512.18335 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025)
por: Mishra, Nina, et al.
Publicado: (2025)
Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
por: Indyk, Piotr, et al.
Publicado: (2025)
por: Indyk, Piotr, et al.
Publicado: (2025)
SpEx: A Spectral Approach to Explainable Clustering
por: Argov, Tal, et al.
Publicado: (2025)
por: Argov, Tal, et al.
Publicado: (2025)
New Bounds for Kernel Sums via Fast Spherical Embeddings
por: Wagner, Tal
Publicado: (2026)
por: Wagner, Tal
Publicado: (2026)
Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
por: Wolfson, Daniel, et al.
Publicado: (2026)
por: Wolfson, Daniel, et al.
Publicado: (2026)
Learning from End User Data with Shuffled Differential Privacy over Kernel Densities
por: Wagner, Tal
Publicado: (2025)
por: Wagner, Tal
Publicado: (2025)
Streaming Graph Algorithms in the Massively Parallel Computation Model
por: Czumaj, Artur, et al.
Publicado: (2025)
por: Czumaj, Artur, et al.
Publicado: (2025)
Sum Estimation via Vector Similarity Search
por: Mussmann, Stephen, et al.
Publicado: (2026)
por: Mussmann, Stephen, et al.
Publicado: (2026)
Near Uniform Triangle Sampling Over Adjacency List Graph Streams
por: Bishnu, Arijit, et al.
Publicado: (2024)
por: Bishnu, Arijit, et al.
Publicado: (2024)
Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)
por: Chekuri, Chandra, et al.
Publicado: (2025)
A practical algorithm for 3-admissibility
por: Awofeso, Christine, et al.
Publicado: (2025)
por: Awofeso, Christine, et al.
Publicado: (2025)
Streaming Algorithms for Connectivity Augmentation
por: Jin, Ce, et al.
Publicado: (2024)
por: Jin, Ce, et al.
Publicado: (2024)
The Kernighan-Lin Search Algorithm
por: Dasdan, Ali
Publicado: (2025)
por: Dasdan, Ali
Publicado: (2025)
Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
por: Dong, Yinhao, et al.
Publicado: (2024)
por: Dong, Yinhao, et al.
Publicado: (2024)
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)
por: Gao, Jianyang, et al.
Publicado: (2024)
Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
por: Buchbinder, Niv, et al.
Publicado: (2026)
por: Buchbinder, Niv, et al.
Publicado: (2026)
Efficient Trace Frequency Queries in Sparse Graphs
por: Awofeso, Christine, et al.
Publicado: (2025)
por: Awofeso, Christine, et al.
Publicado: (2025)
Streaming Algorithms for Bin Packing and Vector Scheduling
por: Cormode, Graham, et al.
Publicado: (2019)
por: Cormode, Graham, et al.
Publicado: (2019)
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)
por: Gao, Jianyang, et al.
Publicado: (2024)
Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
por: Dughmi, Shaddin, et al.
Publicado: (2025)
por: Dughmi, Shaddin, et al.
Publicado: (2025)
Limitations of Stochastic Selection with Pairwise Independent Priors
por: Dughmi, Shaddin, et al.
Publicado: (2023)
por: Dughmi, Shaddin, et al.
Publicado: (2023)
Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
por: Liu, Kaiwen, et al.
Publicado: (2026)
por: Liu, Kaiwen, et al.
Publicado: (2026)
Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
por: Bishnu, Arijit, et al.
Publicado: (2025)
por: Bishnu, Arijit, et al.
Publicado: (2025)
An Optimal Density Bound for Discretized Point Patrolling
por: Mishra, Ahan
Publicado: (2025)
por: Mishra, Ahan
Publicado: (2025)
List Update with Delays or Time Windows
por: Azar, Yossi, et al.
Publicado: (2023)
por: Azar, Yossi, et al.
Publicado: (2023)
Improved Streaming Edge Coloring
por: Chechik, Shiri, et al.
Publicado: (2025)
por: Chechik, Shiri, et al.
Publicado: (2025)
Streaming algorithms for products of probabilities
por: Lohrey, Markus, et al.
Publicado: (2025)
por: Lohrey, Markus, et al.
Publicado: (2025)
On the Streaming Complexity of Expander Decomposition
por: Chen, Yu, et al.
Publicado: (2024)
por: Chen, Yu, et al.
Publicado: (2024)
Adaptively Robust Resettable Streaming
por: Cohen, Edith, et al.
Publicado: (2026)
por: Cohen, Edith, et al.
Publicado: (2026)
Sketching and Streaming for Dictionary Compression
por: Becker, Ruben, et al.
Publicado: (2023)
por: Becker, Ruben, et al.
Publicado: (2023)
Error Correction for Message Streams
por: Gupta, Meghal, et al.
Publicado: (2023)
por: Gupta, Meghal, et al.
Publicado: (2023)
Buffered Streaming Edge Partitioning
por: Chhabra, Adil, et al.
Publicado: (2024)
por: Chhabra, Adil, et al.
Publicado: (2024)
SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
por: Li, Hui, et al.
Publicado: (2025)
por: Li, Hui, et al.
Publicado: (2025)
Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
por: Mazziane, Younes Ben, et al.
Publicado: (2026)
por: Mazziane, Younes Ben, et al.
Publicado: (2026)
Online Orthogonal Vectors Revisited
por: Gajulapalli, Karthik, et al.
Publicado: (2026)
por: Gajulapalli, Karthik, et al.
Publicado: (2026)
Transposition is Nearly Optimal for IID List Update
por: Coester, Christian
Publicado: (2026)
por: Coester, Christian
Publicado: (2026)
Semi-Streaming Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2025)
por: Reinstädtler, Henrik, et al.
Publicado: (2025)
Streaming Diameter of High-Dimensional Points
por: Halldórsson, Magnús M., et al.
Publicado: (2025)
por: Halldórsson, Magnús M., et al.
Publicado: (2025)
Constructing Long Paths in Graph Streams
por: Konrad, Christian, et al.
Publicado: (2025)
por: Konrad, Christian, et al.
Publicado: (2025)
Streaming periodicity with mismatches, wildcards, and edits
por: Ghazi, Taha El, et al.
Publicado: (2025)
por: Ghazi, Taha El, et al.
Publicado: (2025)
Ejemplares similares
-
Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025) -
Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
por: Indyk, Piotr, et al.
Publicado: (2025) -
SpEx: A Spectral Approach to Explainable Clustering
por: Argov, Tal, et al.
Publicado: (2025) -
New Bounds for Kernel Sums via Fast Spherical Embeddings
por: Wagner, Tal
Publicado: (2026) -
Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
por: Wolfson, Daniel, et al.
Publicado: (2026)