Sciweavers

247 search results - page 8 / 50
» Ideals without CCC
Sort
View
TYPES
2004
Springer
14 years 20 days ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
COGSCI
2004
97views more  COGSCI 2004»
13 years 7 months ago
A rhythm recognition computer program to advocate interactivist perception
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
Jean-Christophe Buisson
JOT
2010
124views more  JOT 2010»
13 years 5 months ago
Improving Learning Object Reuse Through OOD: A Theory of Learning Objects
The concept of a learning object (LO) has spread quickly without a very specific universal definition, and though born originally from the idea of object oriented design, with a ...
Claudine A. Allen, Ezra K. Mugisa
CVPR
2000
IEEE
14 years 9 months ago
Representation and Recognition of Complex Human Motion
The quest for a vision system capable of representing and recognizing arbitrary motions benefits from a low dimensional, non-specific representation of flow fields, to be used in ...
Jesse Hoey, James J. Little
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 7 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh