157 search results - page 22 / 32 » Presenting Proofs with Adapted Granularity |
118
click to vote
CSL
2007
Springer
15 years 8 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...
139
Voted
EUROCRYPT
2000
Springer
15 years 5 months ago
2000
Springer
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
136
Voted
CEC
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we present Creature Academy, a virtual laboratory that allows for the evolution of form and function within simulated physical 3D environments. Creature Academy can ...
185
click to vote
SCP
2011
14 years 8 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
124
Voted
ICML
2009
IEEE
16 years 2 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...