Sciweavers

1722 search results - page 125 / 345
» Variables in Concept Graphs
Sort
View
IACR
2011
130views more  IACR 2011»
13 years 9 months ago
Hiding the Policy in Cryptographic Access Control
Abstract. Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows ...
Sascha Müller, Stefan Katzenbeisser
COLT
2007
Springer
15 years 4 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
CC
2010
Springer
120views System Software» more  CC 2010»
14 years 7 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
JMLR
2002
83views more  JMLR 2002»
14 years 9 months ago
On Online Learning of Decision Lists
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
Ziv Nevo, Ran El-Yaniv
ACSD
2007
IEEE
103views Hardware» more  ACSD 2007»
15 years 4 months ago
Output-Determinacy and Asynchronous Circuit Synthesis
Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic...
Victor Khomenko, Mark Schäfer, Walter Vogler