Sciweavers

5344 search results - page 107 / 1069
» Privacy-Preserving Set Operations
Sort
View
106
Voted
ICLP
1994
Springer
15 years 6 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
ENTCS
2006
138views more  ENTCS 2006»
15 years 2 months ago
Some Properties and Some Problems on Set Functors
We study properties of functors on categories of sets (classes) together with set (class) functions. In particular, we investigate the notion of inclusion preserving functor, and ...
Daniela Cancila, Furio Honsell, Marina Lenisa
ORDER
2006
128views more  ORDER 2006»
15 years 2 months ago
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
Joel Berman, Willem J. Blok
TFS
2008
190views more  TFS 2008»
15 years 1 months ago
A Fast Geometric Method for Defuzzification of Type-2 Fuzzy Sets
Generalised type-2 fuzzy logic systems can not currently be used for practical problems because the amount of computation required to defuzzify a generalised type-2 fuzzy set is to...
Simon Coupland, Robert John
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 9 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König