Sciweavers

797 search results - page 125 / 160
» Eliminating Proofs from Programs
Sort
View
PPDP
2007
Springer
14 years 4 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 10 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
DAC
2004
ACM
14 years 10 months ago
Multi-profile based code compression
Code compression has been shown to be an effective technique to reduce code size in memory constrained embedded systems. It has also been used as a way to increase cache hit ratio...
Eduardo Wanderley Netto, Rodolfo Azevedo, Paulo Ce...
HAPTICS
2005
IEEE
14 years 3 months ago
An Experiment on Tracking Surface Features with the Sensation of Slip
This paper describes the last of three experiments that investigate relative motion between a surface and the fingertip (slip) as part of a larger program of research on “finger...
Mark A. Salada, J. Edward Colgate, Peter M. Vishto...
IPSN
2005
Springer
14 years 3 months ago
Telos: enabling ultra-low power wireless research
— We present Telos, an ultra low power wireless sensor module (“mote”) for research and experimentation. Telos is the latest in a line of motes developed by UC Berkeley to en...
Joseph Polastre, Robert Szewczyk, David E. Culler