Sciweavers

9405 search results - page 23 / 1881
» Computing a Model of Set Theory
Sort
View
IACR
2011
152views more  IACR 2011»
13 years 9 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 5 days ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
PODC
2010
ACM
15 years 1 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
ALS
2003
Springer
15 years 3 months ago
Towards a Four Factor Theory of Anticipatory Learning
This paper takes an overtly anticipatory stance to the understanding of animat learning and behavior. It analyses four major animal learning theories and attempts to identify the a...
Mark Witkowski
BPM
2010
Springer
186views Business» more  BPM 2010»
14 years 11 months ago
How to Implement a Theory of Correctness in the Area of Business Processes and Services
During the previous years, we presented several results concerned with various issues related to the correctness of models for business processes and services (i. e., interorganiza...
Niels Lohmann, Karsten Wolf