Filters








19 Hits in 3.1 sec

News from ACM transactions on Computation theory: New Editor-in-Chief

Eric Allender
2017 Bulletin of the European Association for Theoretical Computer Science  
1 The News This is a short note, whose purpose is to update the readers of BEATCS on the status of ACM Transactions on Computation Theory (ToCT).  ...  However, prior to the creation of ToCT, there was no journal published by ACM (the main professional society for computing) that focused primarily on computational complexity theory and allied disciplines  ... 
dblp:journals/eatcs/Allender17 fatcat:6w2kukdxkjblrkx3oorrdufs2q

SoK: Privacy-preserving Deep Learning with Homomorphic Encryption [article]

Robert Podschwadt, Daniel Takabi, Peizhao Hu
2022 arXiv   pre-print
With homomorphic encryption (HE) computation can be performed on encrypted data without revealing its content.  ...  Outsourced computation for neural networks allows users access to state of the art models without needing to invest in specialized hardware and know-how.  ...  Computation Theory (TOCT), vol. 6, no. 3, pp. 1–36, 2014, publisher: [32] F. Boemer, Y. Lao, R. Cammarota, and C.  ... 
arXiv:2112.12855v2 fatcat:35nloctuj5ahlgnlze3u2mcgz4

Portably solving file races with hardness amplification

Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da Silva
2008 ACM Transactions on Storage  
We begin by noting that mazes constitute a generic way to deterministically win many TOCT-TOU races (gone are the days when the probability was small).  ...  Zadok for providing valuable and much appreciated feedback on earlier versions of this manuscript.  ...  Received February 2008; accepted August 2008 ACM Transactions on Storage, Vol. 4, No. 3, Article 9, Publication date: November 2008.  ... 
doi:10.1145/1416944.1416948 fatcat:qxypqofvzzgxvbry4l7sk2vl6e

Holographic vulnerability studies

Jedidiah R. Crandall, Daniela Oliveira
2012 Proceedings of the 2012 workshop on New security paradigms - NSPW '12  
We argue that categorizing vulnerabilities based on this view, as opposed to the types of categories that have been used in past vulnerability studies, makes vulnerability types more easily generalizable  ...  However, transactions only work if one knows the vulnerable sequence of system calls and wrap them in a transaction.  ...  Copyright 2012 ACM 978-1-4503-1794-8/12/09 ...$15.00.  ... 
doi:10.1145/2413296.2413309 dblp:conf/nspw/CrandallO12 fatcat:ll6vefsbureadm4icdy2vbixum

Structural Parameterizations with Modulator Oblivion [article]

Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2020 arXiv   pre-print
One method to solve them is to compute a k-sized or an approximate (f(k) sized, for a function f) chordal vertex deletion set and then use the structural properties of the graph to design an algorithm.  ...  Our algorithms do not compute a chordal vertex deletion set (or even an approximate solution).  ...  On multiway cut parameterized above lower bounds. TOCT, 5(1):3:1–3:11, 2013. [14] R. Diestel. Graph Theory. Springer, 2006. [15] R. G. Downey and M. R. Fellows.  ... 
arXiv:2002.09972v1 fatcat:m5rmbaghtjfwfgnvmftp2kq4o4

Secure and federated linear mixed model association tests [article]

Jeffrey Chen, Manaswitha Edupalli, Bonnie Berger, Hyunghoon Cho
2022 bioRxiv   pre-print
burden of LMMs under existing secure computation frameworks.  ...  We overcome the computational burden of LMMs by leveraging recent advances in LMMs and secure computation, as well as a novel scalable dimensionality reduction technique.  ...  ACM Transactions on Computation Theory (TOCT), 6(3):1–36, 2014. 15 bioRxiv preprint doi: https://doi.org/10.1101/2022.05.20.492837  ... 
doi:10.1101/2022.05.20.492837 fatcat:g646msmkdnf3jkpz2nliyc2lau

ISLET: Fast and Optimal Low-rank Tensor Regression via Importance Sketching [article]

Anru Zhang, Yuetian Luo, Garvesh Raskutti, Ming Yuan
2020 arXiv   pre-print
., carefully designed sketches based on both the responses and low-dimensional structure of the parameter of interest.  ...  achieves comparable or better mean-squared error performance to existing state-of-the-art methods while having substantial storage and run-time advantages including capabilities for parallel and distributed computing  ...  SIAM Journal on Scientific Computing, 31(5):3744-3759, 2009. [97] Rasmus Pagh. Compressed matrix multiplication. ACM Transactions on Computa- tion Theory (TOCT), 5(3):9, 2013.  ... 
arXiv:1911.03804v2 fatcat:ga5lfuwk5zh6ncpatul3wdytga

Exact Matching in Graphs of Bounded Independence Number [article]

Nicolas El Maalouly, Raphael Steiner
2022 arXiv   pre-print
This generalizes previous positive results for complete (bipartite) graphs which were the only known results for EM on dense graphs.  ...  Given that to decide whether or not RP=P represents a big open challenge in complexity theory, this makes it unlikely for EM to be NP-complete, and in fact indicates the possibility of a deterministic  ...  ACM Transactions on Computation Theory (TOCT), 9(2):1-20, 2017. 10 AV Karzanov. Maximum matching of given weight in complete and complete bipartite graphs.  ... 
arXiv:2202.11988v3 fatcat:b34cnmwvhzhjlbkptctx37errq

On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product

Lijie Chen, Marc Herbstritt
2018 Computational Complexity Conference  
., FOCS 2017] on hardness of approximation for polynomial-time problems.  ...  It is also used (implicitly) in the argument for hardness of exact 2 -Furthest Pair (and other important problems in computational geometry) in poly-log-log dimensions in [Williams, SODA 2018].  ...  In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 664-673. ACM, 2014. 72 Ryan Williams.  ... 
doi:10.4230/lipics.ccc.2018.14 dblp:conf/coco/Chen18 fatcat:kvapamkh2nbsfcauc44w7iy344

Prediction of Infinite Words with Automata [article]

Tim Smith
2016 arXiv   pre-print
IEEE Transactions on Information Theory 38, 1258-1270 (1992) 10. Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14(2), 389-418 (Apr 1967) 11.  ...  So M masters α. , D., Smith, C.H.: Inductive inference: Theory and methods. ACM Comput. Surv. 15(3), 237-269 (Sep 1983), http://doi.acm.org/10.1145/356914.356918 3. Blackwell, D.: Minimax vs.  ... 
arXiv:1603.02597v1 fatcat:q4jffgrervantctc4vckqqc3km

Online Learning with Automata-based Expert Sequences [article]

Mehryar Mohri, Scott Yang
2017 arXiv   pre-print
We give a series of algorithms for this problem, including an automata-based algorithm extending weighted-majority and more efficient algorithms based on the notion of failure transitions.  ...  We further present efficient algorithms based on an approximation of the competitor automaton, in particular n-gram models obtained by minimizing the ∞-Rényi divergence, and present an extensive study  ...  ACM Transactions on Computation Theory (TOCT), 6 (3):11, 2014. V. Kanade, H. McMahan, and B. Bryan. Sleeping experts and bandits with stochastic action availability and adversarial rewards.  ... 
arXiv:1705.00132v4 fatcat:t5yjdiinsfajnagd2zyhtuaaaq

06121 Abstracts Collection – Atomicity: A Unifying Concept in Computer Science

Gerhard Weikum, Clifford B. Jones, David Lomet, Alexander Romanovsky
2006
From 19.03.06 to 24.03.06, the Dagstuhl Seminar 06121 "Atomicity: A Unifying Concept in Computer Science" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.  ...  Barbara, USA) Atomic transactions are one of the great successes of modern computing.  ...  However, little theory has existed to decide when it is safe!  ... 
doi:10.4230/dagsemproc.06121.1 fatcat:7qzxyxxsvfbp5geihcmpozotia

Improved Sleeping Bandits with Stochastic Actions Sets and Adversarial Rewards [article]

Aadirupa Saha, Pierre Gaillard, Michal Valko
2020 arXiv   pre-print
., polynomial-time) algorithms for this problem only guarantee an O(T^2/3) upper-bound on the regret. Yet, inefficient algorithms based on EXP4 can achieve O(√(T)).  ...  In this paper, we provide a new computationally efficient algorithm inspired by EXP3 satisfying a regret of order O(√(T)) when the availabilities of each action i ∈ are independent.  ...  ACM Transactions on Computation Theory (TOCT), 6(3):11, 2014. ). Indian Institute of Science, Bangalore, India. 2 Sierra Team, Inria, Paris, France. 3 DeepMind, Paris, France.  ... 
arXiv:2004.06248v2 fatcat:rk45lxboszbd7nswyqf3ezrrmq

Bi-Arc Digraphs and Conservative Polymorphisms [article]

Pavol Hell and Akbar Rafiey and Arash Rafiey
2020 arXiv   pre-print
On the one hand, they are precisely the digraphs that admit certain polymorphisms of interest in the study of constraint satisfaction problems; on the other hand, they are a very broad generalization of  ...  ACM Transactions on Computation Theory (TOCT), 9(3):11, 2017. [COS09] Derek G Corneil, Stephan Olariu, and Lorna Stewart. The lbfs structure and recognition of interval graphs.  ...  In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (STOC), pages 612–622. ACM, 1993. [FV98] Tomás Feder and Moshe Y Vardi.  ... 
arXiv:1608.03368v5 fatcat:es537slt4fgz5d6ke25aqcdjby

Local minimax rates for closeness testing of discrete distributions [article]

Joseph Lam-Weil, Alexandra Carpentier, Bharath K. Sriperumbudur
2021 arXiv   pre-print
In this paper, we focus on adapting the rate to the shape of the underlying distributions, i.e. we consider a local minimax setting.  ...  In view of the rate, closeness testing turns out to be substantially harder than the related one-sample testing problem over a wide range of cases.  ...  ACM Transactions on Computation Theory (TOCT), 10(4):16, 2018. [9] Siu-On Chan, Ilias Diakonikolas, Paul Valiant, and Gregory Valiant.  ... 
arXiv:1902.01219v3 fatcat:6i7fkhba25emhnluxlcygwiuoe
« Previous Showing results 1 — 15 out of 19 results