56 search results - page 6 / 12 » Auditing Boolean Attributes |
VL
2000
IEEE
13 years 11 months ago
2000
IEEE
The accurate formulation of boolean expressions is a notorious problem in programming languages and database query tools. This paper studies the ways that untrained users naturall...
COLT
1991
Springer
13 years 11 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
CRYPTO
2012
Springer
11 years 9 months ago
2012
Springer
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
CLA
2007
13 years 8 months 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...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...