Sciweavers

54 search results - page 2 / 11
» A New Interactive Hashing Theorem
Sort
View
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 10 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
CVPR
2010
IEEE
14 years 20 days ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
ICML
2009
IEEE
14 years 1 months ago
Feature hashing for large scale multitask learning
Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation. In this paper we provide exponential tail bo...
Kilian Q. Weinberger, Anirban Dasgupta, John Langf...
JAR
2007
85views more  JAR 2007»
13 years 7 months ago
User Interaction with the Matita Proof Assistant
Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, characterize...
Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tas...
ICC
2009
IEEE
155views Communications» more  ICC 2009»
13 years 4 months ago
On Hashing with Tweakable Ciphers
Cryptographic hash functions are often built on block ciphers in order to reduce the security of the hash to that of the cipher, and to minimize the hardware size. Proven secure co...
Raphael Chung-Wei Phan, Jean-Philippe Aumasson