Filters








10 Hits in 10.5 sec

Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers [article]

Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford
2021 arXiv   pre-print
A procedure for turning algorithms for estimating a sequence of vectors under updates from an oblivious adversary to one that tolerates adaptive adversaries via the Gaussian-mechanism from differential  ...  Combining these pieces with modifications to prior robust interior point frameworks gives an algorithm that on graphs with m edges computes a mincost flow with edge costs and capacities in [1, U] in time  ...  In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, June 6-8 2011, pages 273–282. ACM, 2011.  ... 
arXiv:2112.00722v1 fatcat:v5fv24yzpbdrzlkeso4ofz5haq

Nearly Optimal Dynamic k-Means Clustering for High-Dimensional Data [article]

Wei Hu, Zhao Song, Lin F. Yang, Peilin Zhong
2019 arXiv   pre-print
For this problem, we provide a one-pass coreset construction algorithm using space Õ(k·poly(d, Δ)), where k is the target number of centers.  ...  We consider the k-means clustering problem in the dynamic streaming setting, where points from a discrete Euclidean space {1, 2, ..., Δ}^d can be dynamically inserted to or deleted from the dataset.  ...  In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 569-578, 2011. Gereon Frahling and Christian Sohler.  ... 
arXiv:1802.00459v2 fatcat:k5leskzjp5ep3gusljc5phxyfm

Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics [article]

Vincent Cohen-Addad and Philip N. Klein and Claire Mathieu
2016 arXiv   pre-print
The algorithm is local search where the local neighborhood of a solution S consists of all solutions obtained from S by removing and adding 1/ϵ^O(1) centers.  ...  Our first and second results extend to minor-closed families of graphs. All our results extend to cost functions that are the p-th power of the shortest-path distance.  ...  In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 569–578, 2011. [24] D. Feldman, M. Monemizadeh, and C.  ... 
arXiv:1603.09535v2 fatcat:nxnzbgzvffcsbj33cuyy2hcqg4

Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching

Arturs Backurs, Piotr Indyk, Ilya Razenshteyn, David P. Woodruffs
2015 Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms  
induced by the norm · on the set of all k-sparse vectors.  ...  Finally, our lower bound for the doubling dimension of the EMD norm enables us to address the open question of [Frahling-Sohler, STOC'05] about the space complexity of clustering problems in the dynamic  ...  Subspace embeddings for the l 1 -norm with applica- tions. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 755-764, 2011.  ... 
doi:10.1137/1.9781611974331.ch24 dblp:conf/soda/BackursIRW16 fatcat:27pneob4wretpjgcqogsnteeja

Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching [article]

Arturs Backurs, Piotr Indyk, Eric Price, Ilya Razenshteyn, David P. Woodruff
2015 arXiv   pre-print
induced by the norm · on the set of all k-sparse vectors.  ...  Finally, our lower bound for the doubling dimension of the EMD norm enables us to address the open question of [Frahling-Sohler, STOC'05] about the space complexity of clustering problems in the dynamic  ...  Subspace embeddings for the l 1 -norm with applica- tions. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 755-764, 2011.  ... 
arXiv:1504.01076v1 fatcat:jxyastg24nbi7dxmicdddwogha

A Tight Deterministic Algorithm for the Submodular Multiple Knapsack Problem [article]

Xiaoming Sun, Jialin Zhang, Zhijie Zhang
2021 arXiv   pre-print
Submodular function maximization has been a central topic in the theoretical computer science community over the last decade.  ...  Their algorithm is based on the continuous greedy technique which inherently involves randomness. However, the deterministic algorithm of this problem has not been understood very well previously.  ...  In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 783-792, 2011. [30] Yuichi Yoshida.  ... 
arXiv:2003.11450v4 fatcat:i55r5ozy2zfurlln5hotamsltm

Minimax Optimal Estimators for Additive Scalar Functionals of Discrete Distributions [article]

Kazuto Fukuchi, Jun Sakuma
2017 arXiv   pre-print
We reveal that the minimax optimal rate is characterized by the divergence speed of the fourth derivative of ϕ if the divergence speed is high.  ...  As a result, we show there is no consistent estimator if the divergence speed of the fourth derivative of ϕ is larger than p^-4.  ...  Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 685-694. ACM, 2011a. doi: 10.1145/1993636.1993727.  ... 
arXiv:1701.06381v3 fatcat:bcddnbm55jfkdk4i3o5shxrlcy

On the Power of Statistical Zero Knowledge [article]

Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan
2017 arXiv   pre-print
The first of these results answers a question raised in 1991 by Aiello and Håstad (Information and Computation), and the second answers a question of Lovett and Zhang (2016).  ...  We examine the power of statistical zero knowledge proofs (captured by the complexity class SZK) and their variants.  ...  Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 685-694, 2011.  ... 
arXiv:1609.02888v4 fatcat:v7bmprt7incjlfkfmsq6vu4ena

50 Algebra in Computational Complexity (Dagstuhl Seminar 14391) Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, and Christopher Umans 85 Privacy and Security in an Age of Surveillance (Dagstuhl Perspectives Workshop

Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden, Artur D'avila Garcez, Marco Gori, Pascal Hitzler, Luís Lamb, Bart Preneel, Phillip Rogaway, Mark Ryan, Peter (+5 others)
unpublished
(Carnegie Mellon University -Pittsburgh, US) License Creative Commons BY 3.0 Unported license © ACM Symp. on Theory of Computing ( STOC'11), pp. 793-802, ACM, 2011; pre-print available from author's  ...  Röglin, "Improved Smoothed Analysis of Multiobjective Optimization," in Proc. of the 44th Annual ACM Symp./ on Theory of Computing (STOC'12), pp. 407-426, ACM, 2012.  ...  Compared to the perspective workshop, our proposed seminar is much more focused on single, pressing topic of exascale computing, namely resilience.  ... 
fatcat:e5wnf6cuhvc3bceegijgut34zm

st Symposium on Simplicity in Algorithms New Orleans LA, USA Co-located with The 29th ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)

Raimund Seidel
2018 unpublished
In an earlier version of the proof of Theorem 3, we erroneously claimed that, conditioned on the current sampling rate being 1/2 j , edges in E t α had been sampled at that rate.  ...  Ravi and Madhur Tulsiani for helpful discussions and comments on the presentation. Acknowledgement.  ...  Servedio and Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 31-40.  ... 
fatcat:tvuaojfsvjgfjaj7en2x4wdbhy