Sciweavers

171 search results - page 29 / 35
» Weak theories of linear algebra
Sort
View
EUROCRYPT
2012
Springer
11 years 9 months ago
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
This paper proposes the first inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz...
Tatsuaki Okamoto, Katsuyuki Takashima
DALT
2005
Springer
14 years 7 days ago
Resource-Bounded Belief Revision and Contraction
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
Natasha Alechina, Mark Jago, Brian Logan
COLT
2000
Springer
13 years 11 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 10 months ago
Probabilistic Logic: Many-valuedness and Intensionality
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
Zoran Majkic
MICAI
2005
Springer
14 years 6 days ago
Directed Cycles in Bayesian Belief Networks: Probabilistic Semantics and Consistency Checking Complexity
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
Alexander L. Tulupyev, Sergey I. Nikolenko