Sciweavers

397 search results - page 56 / 80
» Pseudorandom Functions and Lattices
Sort
View
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
15 years 4 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
FOCS
1989
IEEE
15 years 5 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
LATA
2010
Springer
15 years 8 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
VISUALIZATION
2005
IEEE
15 years 6 months ago
VolQD: Direct Volume Rendering of Multi-million Atom Quantum Dot Simulations
In this work we present a hardware-accelerated direct volume rendering system for visualizing multivariate wave functions in semiconducting quantum dot (QD) simulations. The simul...
Wei Qiao, David S. Ebert, Alireza Entezari, Marek ...
AI
2008
Springer
15 years 1 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund