The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Some Applications of Coding Theory in Computational Complexity
[article]
2004
arXiv
pre-print
Preserved Fulltext
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
2008
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
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
2013
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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
2017
World wide web (Bussum)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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
2011
2011 Eleventh International Conference on Application of Concurrency to System Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
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
2014
Vestnik komp iuternykh i informatsionnykh tekhnologii
ABSTRAGIROVANIE NIZKOUROVNEVYKh API PRI SOZDANII KROSSPLATFORMENNYKh GRAFIChESKIKh PRILOZhENII
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
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
2017
Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2010.02307v1 fatcat:kk6lxis4drcb7nxxcz25uwkoke
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]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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
2011
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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
2015
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
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
2016
Computational Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
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]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
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
1994
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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