Sciweavers

4128 search results - page 762 / 826
» Learning and using relational theories
Sort
View
POPL
2011
ACM
14 years 20 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters
HPCA
2008
IEEE
15 years 10 months ago
Automated microprocessor stressmark generation
Estimating the maximum power and thermal characteristics of a processor is essential for designing its power delivery system, packaging, cooling, and power/thermal management sche...
Ajay M. Joshi, Lieven Eeckhout, Lizy Kurian John, ...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
15 years 10 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 2 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin