9370 search results - page 11 / 1874 » An Abstract Notion of Application |
114
click to vote
CORR
2010
Springer
15 years 6 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...
163
click to vote
ICALP
2005
Springer
15 years 11 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...
176
click to vote
EUROCRYPT
2007
Springer
15 years 9 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 [...
162
click to vote
SEMWEB
2004
Springer
15 years 11 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...