360 search results - page 34 / 72 » Explanations and Proof Trees |
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
IACR
2011
12 years 9 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
ECML
2004
Springer
14 years 3 months ago
2004
Springer
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
IBPRIA
2007
Springer
13 years 11 months ago
2007
Springer
This work describes an approach for the interpretation and explanation of human behavior in image sequences, within the context of a Cognitive Vision System. The information source...