Sciweavers

3328 search results - page 584 / 666
» On Plateaued Functions and Their Constructions
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
WWW
2005
ACM
16 years 7 months ago
A convenient method for securely managing passwords
Computer users are asked to generate, keep secret, and recall an increasing number of passwords for uses including host accounts, email servers, e-commerce sites, and online finan...
J. Alex Halderman, Brent Waters, Edward W. Felten
ICFP
2009
ACM
16 years 7 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...
ICFP
2009
ACM
16 years 7 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
PLDI
2009
ACM
16 years 7 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...