5344 search results - page 37 / 1069 » Privacy-Preserving Set Operations |
ISMIS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Subsystem based generalizations of rough set approximations are investigated. Instead of using an equivalence relation, an arbitrary binary relation is used to construct ...
APAL
1998
13 years 9 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
PPOPP
2009
ACM
14 years 10 months ago
2009
ACM
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
IJCAI
2007
13 years 11 months ago
2007
Motivated by basic ideas from formal concept analysis, we propose two ways to directly encode closure operators on finite sets in a 3-layered feed forward neural network.
JLP
2002
13 years 9 months ago
2002
In the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a unit instruction operator, into PGA is defined. This is done via a composition that empl...