Sciweavers

52 search results - page 3 / 11
» Representable Disjoint NP-Pairs
Sort
View
KRDB
2003
121views Database» more  KRDB 2003»
13 years 7 months ago
Knowledge Representation using Schema Tuple Queries
This paper introduces schema tuple queries and argues for their suitability in representing knowledge over standard relational databases. Schema tuple queries are queries that ret...
Michael Minock
EVOW
2004
Springer
13 years 11 months ago
Disjoint Sum of Product Minimization by Evolutionary Algorithms
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
Nicole Drechsler, Mario Hilgemeier, Görschwin...
FC
2005
Springer
142views Cryptology» more  FC 2005»
13 years 11 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
CORR
2011
Springer
197views Education» more  CORR 2011»
13 years 1 months ago
Arrangements of double pseudolines
We define a double pseudoline as a simple closed curve in the open M¨obius band homotopic to the double of its core circle, and we define an arrangement of double pseudolines a...
Luc Habert, Michel Pocchiola
JUCS
2006
87views more  JUCS 2006»
13 years 6 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral