136 search results - page 26 / 28 » Boolean Formulas and Frequent Sets |
ECCC
2007
13 years 10 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
CLA
2007
14 years 9 days ago
2007
Formal Concept Analysis is based on the occurrence of symbolic attributes in individual objects, or observations. But, when the attribute is numeric, treatment has been awkward. In...
FUIN
2008
13 years 11 months ago
2008
The issue addressed in this paper concerns the discovery of frequent multi-dimensional patterns from relational sequences. The great variety of applications of sequential pattern m...
EUROCRYPT
2011
Springer
13 years 2 months ago
2011
Springer
We propose a Multi-Authority Attribute-Based Encryption (ABE) system. In our system, any party can become an authority and there is no requirement for any global coordination othe...
SIGMOD
2011
ACM
13 years 1 months ago
2011
ACM
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...