351 search results - page 41 / 71 » Classical proof forestry |
POPL
2010
ACM
13 years 7 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
JCT
2007
13 years 7 months ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
SIAMCOMP
2002
13 years 7 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...