7924 search results - page 130 / 1585 » Non-Malleable Functions and Their Applications |
ASWEC
2004
IEEE
14 years 23 days ago
2004
IEEE
"Totally Functional Programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practi...
GECCO
2006
Springer
14 years 20 days ago
2006
Springer
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
CONSTRAINTS
2008
13 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
ISCAS
2006
IEEE
14 years 3 months ago
2006
IEEE
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
EMNLP
2006
13 years 10 months ago
2006
The automatic recognition of the rhetorical function of citations in scientific text has many applications, from improvement of impact factor calculations to text summarisation an...