5344 search results - page 93 / 1069 » Privacy-Preserving Set Operations |
SAS
2007
Springer
14 years 4 months ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
LPAR
2005
Springer
14 years 3 months ago
2005
Springer
We present a new answer set solver, called nomore++, along with its underlying theoretical foundations. A distinguishing feature is that it treats heads and bodies equitably as com...
PODS
1991
ACM
14 years 1 months ago
1991
ACM
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
EUROCAST
2009
Springer
14 years 1 months ago
2009
Springer
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
AML
2006
13 years 10 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...