Filters








874 Hits in 10.0 sec

Some Applications of Coding Theory in Computational Complexity [article]

Luca Trevisan
2004 arXiv   pre-print
They are related to private information retrieval (a type of cryptographic protocol), and they are used in average-case complexity and to construct "hard-core predicates" for one-way permutations.  ...  In this paper we survey results on locally-testable and locally-decodable error-correcting codes, and their applications to complexity theory and to cryptography.  ...  In Fall 2003 I taught a graduate class on applications of coding theory to computational complexity, I thank the students who took the class for their enthusiasm and participation.  ... 
arXiv:cs/0409044v1 fatcat:46gkw3tgnfbz7gfkwyrzgbw4wm

List-decoding reed-muller codes over small fields

Parikshit Gopalan, Adam R. Klivans, David Zuckerman
2008 Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08  
Over small fields Fq, we present list-decoding algorithms in both the global and local settings that work up to the list-decoding radius.  ...  We present the first local list-decoding algorithm for the r th order Reed-Muller code RM(r, m) over F2 for r ≥ 2.  ...  Thanks to Venkatesan Guruswami and Salil Vadhan for several helpful discussions and pointers to literature.  ... 
doi:10.1145/1374376.1374417 dblp:conf/stoc/GopalanKZ08 fatcat:ybhdm4rwd5ahjd45orfwqqod7a

XLynx—An FPGA-based XML filter for hybrid XQuery processing

Jens Teubner, Louis Woods, Chongling Nie
2013 ACM Transactions on Database Systems  
Either the programmable chips have been used for very basic application tasks (such as implementing a rigid class of selection predicates), or their circuit definition had to be completely re-compiled  ...  We showcase skeleton automata based on XML projection [Marian and Siméon 2003], a filtering technique that illustrates the feasibility of our strategy for a real-world and challenging task.  ...  Netezza [Netezza 2012] offers selection and projection predicates that can be parameterized for a given query, but lacks flexibility to construct complex predicates.  ... 
doi:10.1145/2536800 fatcat:3zlqnjgdhndg3ecc2vd2ksnotq

SharkDB: an in-memory column-oriented storage for trajectory analysis

Bolong Zheng, Haozhou Wang, Kai Zheng, Han Su, Kuien Liu, Shuo Shang
2017 World wide web (Bussum)  
However some characteristics of trajectories such as variable lengths and asynchronous sampling rates make it difficult to fit into traditional database systems that are disk-based and tuple-oriented.  ...  We found this column-wise storage to be surprisingly well suited for in-memory Kai Zheng  ...  query point and minus the D max as the lower bound.  ... 
doi:10.1007/s11280-017-0466-9 fatcat:jbj6u6a56vdwxkzbxsddggkx3m

Timed Games for Computing WCET for Pipelined Processors with Caches

Franck Cassez
2011 2011 Eleventh International Conference on Application of Concurrency to System Design  
We introduce a framework for computing upper bounds of WCET for hardware with caches and pipelines.  ...  We demonstrate the applicability of our framework on standard benchmarks for an ARM9 processor with instruction and data caches, and compute the WCET with UPPAAL-TiGA.  ...  It is then a challenging problem to determine a precise WCET even for relatively small programs running on complex architectures. Methods and Tools for the WCET Problem.  ... 
doi:10.1109/acsd.2011.15 dblp:conf/acsd/Cassez11 fatcat:5gbiixomsnguph2oslvmcvqqkm

ABSTRACTING LOW-LEVEL APIS FOR CROSS-PLATFORM GRAPHICS APPLICATION DEVELOPMENT
ABSTRAGIROVANIE NIZKOUROVNEVYKh API PRI SOZDANII KROSSPLATFORMENNYKh GRAFIChESKIKh PRILOZhENII

V. D. Shakaev, О. А. Shabalina
2014 Vestnik komp iuternykh i informatsionnykh tekhnologii  
Finally, results and possible improvements and future enhancements for current state-of-the-art algorithms conclude this thesis.  ...  Concluding the first part, prerequisites and building blocks for implementing visibility algorithms are developed.  ...  This decreases the number of issued queries, and potentially saves a huge amount of fill rate.  ... 
doi:10.14489/vkit.2014.08.pp.011-016 fatcat:haexayusvnfe3pf7dmo6oldija

Secure server-aided top-k monitoring

Yujue Wang, HweeHwa Pang, Yanjiang Yang, Xuhua Ding
2017 Information Sciences  
For scalability and availability reasons, this calculation is delegated to third-party servers, which gives rise to the need to protect the integrity and privacy of the documents and user queries.  ...  We also offer techniques to bound the computation demand in decoding the correlation scores, and we demonstrate the practicality of the scheme through experiments with real data.  ...  The score v k of the k th ranked document provides another lower bound to limit the search for v .  ... 
doi:10.1016/j.ins.2017.08.068 fatcat:hg27ejxdhba6rbh4ukl5tmfqma

KGPT: Knowledge-Grounded Pre-Training for Data-to-Text Generation [article]

Wenhu Chen, Yu Su, Xifeng Yan, William Yang Wang
2020 arXiv   pre-print
However, they rely on a significant amount of labeled data for each task, which is costly to acquire and thus limits their application to new tasks and domains.  ...  In this paper, we propose to leverage pre-training and transfer learning to address this issue.  ...  Acknowledgement The authors would like to thank the anonymous reviewers for their thoughtful comments.  ... 
arXiv:2010.02307v2 fatcat:bvasemdg7respl7o36bucyaajy

The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes [article]

Scott Aaronson
2016 arXiv   pre-print
Those topics include the power of quantum proofs and advice states; how to construct quantum money schemes secure against counterfeiting; and the role of complexity in the black-hole information paradox  ...  and the AdS/CFT correspondence (through connections made by Harlow-Hayden, Susskind, and others).  ...  The above question is really asking: how hard is it to prove exponential lower bounds on quantum circuit complexity for explicitly-given unitary matrices?  ... 
arXiv:1607.05256v1 fatcat:mnpmspgwlrdk5pm3fcsthl3lui

Sorting networks on FPGAs

Rene Mueller, Jens Teubner, Gustavo Alonso
2011 The VLDB journal  
Software-configurable microprocessors and FPGAs add further diversity but also increase complexity. In this paper, we explore the use of sorting networks on fieldprogrammable gate arrays (FPGAs).  ...  Computer architectures are quickly changing toward heterogeneous many-core systems.  ...  Bitonic Merge and Even-odd Merge sorters have the same depth and the same asymptotic complexity.  ... 
doi:10.1007/s00778-011-0232-z fatcat:fzqmyyyvifeipflgj5aitw7taa

Non-Interactive Proofs of Proximity

Tom Gur, Ron D. Rothblum
2015 Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15  
On the negative side, we also show that there exist properties for which even a linearly-long (non-interactive) proof of proximity cannot significantly reduce the query complexity. * This is a revised  ...  In addition, we show a natural problem that has a full and (almost) tight multiplicative trade-off between the length of the proof and the verifier's query complexity.  ...  We also thank Oded for multiple technical and conceptual suggestions that greatly improved both the results and presentation of this work, and for allowing us to include his generalization of [GS06,  ... 
doi:10.1145/2688073.2688079 dblp:conf/innovations/GurR15 fatcat:mf5okdnhqrhp3ko256zesiqpty

Non-interactive proofs of proximity

Tom Gur, Ron D. Rothblum
2016 Computational Complexity  
On the negative side, we also show that there exist properties for which even a linearly-long (non-interactive) proof of proximity cannot significantly reduce the query complexity. * This is a revised  ...  In addition, we show a natural problem that has a full and (almost) tight multiplicative trade-off between the length of the proof and the verifier's query complexity.  ...  We also thank Oded for multiple technical and conceptual suggestions that greatly improved both the results and presentation of this work, and for allowing us to include his generalization of [GS06,  ... 
doi:10.1007/s00037-016-0136-9 fatcat:ny65uzg76zhg7do3yeq6gzkuee

Machine Learning Models that Remember Too Much [article]

Congzheng Song, Thomas Ristenpart, Vitaly Shmatikov
2017 arXiv   pre-print
We evaluate our techniques on standard ML tasks for image classification (CIFAR10), face recognition (LFW and FaceScrub), and text analysis (20 Newsgroups and IMDB).  ...  In this setting, we design and implement practical algorithms, some of them very similar to standard ML techniques such as regularization and data augmentation, that "memorize" information about the training  ...  urban rosebud of texas at local obsess and in brave newton girl holly comes from small town in texas sings the yellow rose of texas at local competition maybe need to have my head examined but thought  ... 
arXiv:1709.07886v1 fatcat:ggxi5se6p5h7ncj7zzkkkmnl5m

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [article]

Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman (+3 others)
2010 arXiv   pre-print
These are the lecture notes for the DIMACS Tutorial "Limits of Approximation Algorithms: PCPs and Unique Games" held at the DIMACS Center, CoRE Building, Rutgers University on 20-21 July, 2009.  ...  This tutorial was jointly sponsored by the DIMACS Special Focus on Hardness of Approximation, the DIMACS Special Focus on Algorithmic Foundations of the Internet, and the Center for Computational Intractability  ...  the number of small cycles can be bounded.  ... 
arXiv:1002.3864v1 fatcat:ys2sgp7aqvgmtio32575q3e43y

1983–1993: The wonder years of sequential Prolog implementation

Peter Van Roy
1994 The Journal of Logic Programming  
For certain algorithms, this means that simple logical definitions can run with a lower order of complexity.  ...  single predicate) dominates even for well-written deterministic pro- grams.  ... 
doi:10.1016/0743-1066(94)90031-0 fatcat:kmwktuqn6ndovmlonzxyuxn5im
« Previous Showing results 1 — 15 out of 874 results