Sciweavers

503 search results - page 17 / 101
» An Independence Relation for Sets of Secrets
Sort
View
LICS
2007
IEEE
14 years 2 months ago
Relational Parametricity for Computational Effects
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
Rasmus Ejlers Møgelberg, Alex Simpson
SSPR
2004
Springer
14 years 1 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
ICDE
1993
IEEE
104views Database» more  ICDE 1993»
14 years 18 days ago
Deterministic Semantics of Set-Oriented Update Sequences
An iterator is proposed that allows to apply sequences of update operations in a set-oriented way with deterministic semantics. Because the mechanism is independent of a particula...
Christian Laasch, Marc H. Scholl
PROVSEC
2009
Springer
14 years 3 months ago
GUC-Secure Set-Intersection Computation
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
Yuan Tian, Hao Zhang
BSL
2000
153views more  BSL 2000»
13 years 8 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon