Sciweavers

1786 search results - page 316 / 358
» The Structure of Factor Oracles
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
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
2004
ACM
112views Database» more  VLDB 2004»
16 years 2 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2007
ACM
178views Database» more  SIGMOD 2007»
16 years 2 months ago
Quality is in the eye of the beholder: towards user-centric web-databases
The proliferation of database-driven web sites (or web-databases) has brought upon a plethora of applications where both Quality of Service (QoS) and Quality of Data (QoD) are of ...
Huiming Qu, Jie Xu, Alexandros Labrinidis
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
16 years 2 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...