171 search results - page 4 / 35 » Weak theories of linear algebra |
STACS
1997
Springer
13 years 10 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
BIRTHDAY
2000
Springer
13 years 11 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
SACMAT
2009
ACM
14 years 1 months ago
2009
ACM
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
ML
2002
ACM
13 years 6 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
LICS
2002
IEEE
13 years 11 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...