9370 search results - page 11 / 1874 » An Abstract Notion of Application |
ENTCS
2006
13 years 9 months ago
2006
d Abstract) 1 Matthias Schr
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
d Abstract) MohammadReza Mousavi and Michel A. Reniers Department of Computer Science, Eindhoven University of Technology, NL-5600MB Eindhoven, The Netherlands Abstract. In this pa...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
SEMWEB
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...