Sciweavers

11909 search results - page 161 / 2382
» The Scheme Programming Language
Sort
View
ICALP
2010
Springer
15 years 11 months ago
On the k-Independence Required by Linear Probing and Minwise Independence
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
Mihai Patrascu, Mikkel Thorup
ICALP
1998
Springer
15 years 10 months ago
Bridges for Concatenation Hierarchies
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
Jean-Eric Pin
IFIP
2010
Springer
15 years 1 months ago
A Calculus for the Analysis of Wireless Network Security Protocols
We propose a timed broadcasting calculus for wireless systems. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled ...
Francesco Ballardin, Massimo Merro
POPL
2007
ACM
16 years 6 months ago
Lazy multivariate higher-order forward-mode AD
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
Barak A. Pearlmutter, Jeffrey Mark Siskind
ICFP
2005
ACM
16 years 1 days ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...