| 251 |
Provable learning of Noisy-or Networks
Sanjeev Arora, Rong Ge, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
28 |
9 years ago |
| 252 |
A Size-Free CLT for Poisson Multinomials and its Applications
Constantinos Daskalakis, Anindya De, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
28 |
10 years ago |
| 253 |
The Power of Multi-Step Vizing Chains
Aleksander B G Christiansen
|
👻
Ghosted
|
cs.DS
|
28 |
3 years ago |
| 254 |
A $(1.5+ε)$-Approximation Algorithm for Weighted Connectivity Augmentation
Vera Traub, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
28 |
3 years ago |
| 255 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates
Dominik Kempa, Tomasz Kociumaka
|
👻
Ghosted
|
cs.DS
|
28 |
4 years ago |
| 256 |
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
Yeyuan Chen, Zihan Zhang
|
👻
Ghosted
|
cs.IT
|
27 |
1 year ago |
| 257 |
Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu
Arnab Bhattacharyya, Sutanu Gayen, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
27 |
5 years ago |
| 258 |
Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
Seth Pettie, Dingyu Wang
|
👻
Ghosted
|
cs.DS
|
27 |
5 years ago |
| 259 |
Deep Learning for Energy Markets
Michael Polson, Vadim Sokolov
|
👻
Ghosted
|
stat.ML
|
27 |
7 years ago |
| 260 |
Lower Bounds for External Memory Integer Sorting via Network Coding
Alireza Farhadi, MohammadTaghi Hajiaghayi, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
27 |
7 years ago |
| 261 |
Concurrent Composition Theorems for Differential Privacy
Salil Vadhan, Wanrong Zhang
|
👻
Ghosted
|
cs.DS
|
27 |
3 years ago |
| 262 |
Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS
Hedyeh Beyhaghi, Linda Cai
|
👻
Ghosted
|
cs.DS
|
27 |
3 years ago |
| 263 |
The Randomized $k$-Server Conjecture is False!
Sébastien Bubeck, Christian Coester, Yuval Rabani
|
👻
Ghosted
|
cs.DS
|
27 |
3 years ago |
| 264 |
Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
Louis Golowich, Ting-Chun Lin
|
👻
Ghosted
|
quant-ph
|
26 |
1 year ago |
| 265 |
A New Approach to Learning Linear Dynamical Systems
Ainesh Bakshi, Allen Liu, ... (+2 more)
|
👻
Ghosted
|
math.OC
|
26 |
3 years ago |
| 266 |
Hop-Constrained Oblivious Routing
Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
|
👻
Ghosted
|
cs.DS
|
26 |
5 years ago |
| 267 |
Non-Adaptive Adaptive Sampling on Turnstile Streams
Sepideh Mahabadi, Ilya Razenshteyn, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
26 |
6 years ago |
| 268 |
Communication Complexity of Estimating Correlations
Uri Hadar, Jingbo Liu, ... (+2 more)
|
👻
Ghosted
|
cs.IT
|
26 |
7 years ago |
| 269 |
A unifying method for the design of algorithms canonizing combinatorial objects
Pascal Schweitzer, Daniel Wiebking
|
👻
Ghosted
|
cs.DS
|
26 |
7 years ago |
| 270 |
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths
Nairen Cao, Jeremy T. Fineman, Katina Russell
|
👻
Ghosted
|
cs.DS
|
25 |
6 years ago |
| 271 |
Prioritized Metric Structures and Embedding
Michael Elkin, Arnold Filtser, Ofer Neiman
|
👻
Ghosted
|
cs.DS
|
25 |
11 years ago |
| 272 |
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein
|
👻
Ghosted
|
cs.DS
|
25 |
3 years ago |
| 273 |
The Limits of Pan Privacy and Shuffle Privacy for Learning and Estimation
Albert Cheu, Jonathan Ullman
|
👻
Ghosted
|
cs.DS
|
24 |
5 years ago |
| 274 |
Arıkan meets Shannon: Polar codes with near-optimal convergence to channel capacity
Venkatesan Guruswami, Andrii Riazanov, Min Ye
|
👻
Ghosted
|
cs.IT
|
24 |
6 years ago |
| 275 |
An Improved Approximation Algorithm for TSP in the Half Integral Case
Anna Karlin, Nathan Klein, Shayan Oveis Gharan
|
👻
Ghosted
|
cs.DS
|
24 |
6 years ago |
| 276 |
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max
Karl Bringmann, Marvin Künnemann, Karol Węgrzycki
|
👻
Ghosted
|
cs.DS
|
24 |
6 years ago |
| 277 |
On a generalization of iterated and randomized rounding
Nikhil Bansal
|
👻
Ghosted
|
cs.DS
|
24 |
7 years ago |
| 278 |
Almost Polynomial Hardness of Node-Disjoint Paths in Grids
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
|
👻
Ghosted
|
cs.DS
|
24 |
8 years ago |
| 279 |
Decremental Single-Source Reachability in Planar Digraphs
Giuseppe F. Italiano, Adam Karczmarz, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
24 |
8 years ago |
| 280 |
Understanding the Cluster LP for Correlation Clustering
Nairen Cao, Vincent Cohen-Addad, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
23 |
2 years ago |
| 281 |
Quantum fault tolerance with constant-space and logarithmic-time overheads
Quynh T. Nguyen, Christopher A. Pattison
|
👻
Ghosted
|
quant-ph
|
23 |
1 year ago |
| 282 |
Application of deep learning to large scale riverine flow velocity estimation
Mojtaba Forghani, Yizhou Qian, ... (+5 more)
|
👻
Ghosted
|
cs.LG
|
23 |
5 years ago |
| 283 |
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors
Jesper Nederlof, Karol Węgrzycki
|
👻
Ghosted
|
cs.DS
|
23 |
5 years ago |
| 284 |
Distributed Weighted Min-Cut in Nearly-Optimal Time
Michal Dory, Yuval Efron, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
23 |
6 years ago |
| 285 |
Approximating Text-to-Pattern Hamming Distances
Timothy M. Chan, Shay Golan, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
23 |
6 years ago |
| 286 |
Estimating Normalizing Constants for Log-Concave Distributions: Algorithms and Lower Bounds
Rong Ge, Holden Lee, Jianfeng Lu
|
👻
Ghosted
|
cs.DS
|
23 |
6 years ago |
| 287 |
Holiest Minimum-Cost Paths and Flows in Surface Graphs
Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
|
👻
Ghosted
|
cs.DS
|
23 |
8 years ago |
| 288 |
Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization
Edith Cohen, Xin Lyu, ... (+3 more)
|
👻
Ghosted
|
cs.LG
|
23 |
3 years ago |
| 289 |
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification
Arun Jambulapati, Yang P. Liu, Aaron Sidford
|
👻
Ghosted
|
cs.DS
|
23 |
3 years ago |
| 290 |
Testing distributional assumptions of learning algorithms
Ronitt Rubinfeld, Arsen Vasilyan
|
👻
Ghosted
|
cs.LG
|
23 |
4 years ago |
| 291 |
Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
Sitan Chen, Weiyuan Gong, ... (+2 more)
|
👻
Ghosted
|
quant-ph
|
22 |
1 year ago |
| 292 |
Optimal Embedding Dimension for Sparse Subspace Embeddings
Shabarish Chenakkod, Michał Dereziński, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
2 years ago |
| 293 |
Improved Dynamic Algorithms for Longest Increasing Subsequence
Tomasz Kociumaka, Saeed Seddighin
|
👻
Ghosted
|
cs.DS
|
22 |
5 years ago |
| 294 |
Contention Resolution Without Collision Detection
Michael A. Bender, Tsvi Kopelowitz, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
6 years ago |
| 295 |
Three-in-a-Tree in Near Linear Time
Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup
|
👻
Ghosted
|
cs.DS
|
22 |
6 years ago |
| 296 |
Spectral Methods from Tensor Networks
Ankur Moitra, Alexander S. Wein
|
👻
Ghosted
|
cs.DS
|
22 |
7 years ago |
| 297 |
Smooth heaps and a dual view of self-adjusting data structures
László Kozma, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
22 |
8 years ago |
| 298 |
Approximating Nash Social Welfare by Matching and Local Search
Jugal Garg, Edin Husić, ... (+3 more)
|
👻
Ghosted
|
cs.GT
|
22 |
3 years ago |
| 299 |
On Regularity Lemma and Barriers in Streaming and Dynamic Matching
Sepehr Assadi, Soheil Behnezhad, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
3 years ago |
| 300 |
Deterministic, Near-Linear $\varepsilon$-Approximation Algorithm for Geometric Bipartite Matching
Pankaj K. Agarwal, Hsien-Chih Chang, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
22 |
4 years ago |