Sciweavers

5904 search results - page 542 / 1181
» Requirements for a Composition Language
Sort
View
IACR
2011
92views more  IACR 2011»
14 years 6 months ago
From Non-Adaptive to Adaptive Pseudorandom Functions
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
Iftach Haitner, Itay Berman
ASPLOS
2006
ACM
16 years 1 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
EJC
2003
15 years 8 months ago
A Theory of Signs for Database Semantics
The goal of this paper is to build a bridge from a certain intuitive conception of natural language communication, called the SLIM theory of language, to a technical approach, cal...
Roland Hausser
ALIFE
2000
15 years 7 months ago
Talking Helps: Evolving Communicating Agents for the Predator-Prey Pursuit Problem
We analyze a general model of multi-agent communication in which all agents communicate simultaneously to a message board. A genetic algorithm is used to evolve multi-agent languag...
Kam-Chuen Jim, C. Lee Giles
SIGMOD
2003
ACM
126views Database» more  SIGMOD 2003»
16 years 7 months ago
Issues in data stream management
Traditional databases store sets of relatively static records with no pre-defined notion of time, unless timestamp attributes are explicitly added. While this model adequately rep...
Lukasz Golab, M. Tamer Özsu