Sciweavers

184 search results - page 5 / 37
» Querying Proofs
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 8 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
13 years 1 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
ICDT
2009
ACM
108views Database» more  ICDT 2009»
14 years 7 months ago
A compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
Christoph Koch
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 11 days ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
DALT
2005
Springer
14 years 15 days ago
Beliefs in Agent Implementation
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
Laurens Winkelhagen, Mehdi Dastani, Jan Broersen