Sciweavers

5962 search results - page 1131 / 1193
» Working with Patterns and Code
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 2 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 2 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
OSDI
2008
ACM
16 years 2 months ago
Hardware Enforcement of Application Security Policies Using Tagged Memory
Computers are notoriously insecure, in part because application security policies do not map well onto traditional protection mechanisms such as Unix user accounts or hardware pag...
Nickolai Zeldovich, Hari Kannan, Michael Dalton, C...
VLDB
2007
ACM
128views Database» more  VLDB 2007»
16 years 2 months ago
Automating the Detection of Snapshot Isolation Anomalies
Snapshot isolation (SI) provides significantly improved concurrency over 2PL, allowing reads to be non-blocking. Unfortunately, it can also lead to non-serializable executions in ...
Sudhir Jorwekar, Alan Fekete, Krithi Ramamritham, ...
SIGMOD
2002
ACM
181views Database» more  SIGMOD 2002»
16 years 2 months ago
Archiving scientific data
This report is part of the seminar Digital Information Curation held by Prof. Dr. Marc H. Scholl and Dr. Andr?e Seifert during the winter term 2005/06. Its intention is to summari...
Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang...
« Prev « First page 1131 / 1193 Last » Next »