Sciweavers

16430 search results - page 643 / 3286
» On Computable Tree Functions
Sort
View
STACS
1999
Springer
15 years 11 months ago
The Weakness of Self-Complementation
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Orna Kupferman, Moshe Y. Vardi
PAMI
2006
84views more  PAMI 2006»
15 years 7 months ago
Wavelet Approximation-Based Affine Invariant Shape Representation Functions
In this paper, new wavelet-based affine invariant functions for shape representation are presented. Unlike the previous representation functions, only the approximation coefficient...
Ibrahim El Rube, Maher Ahmed, Mohamed S. Kamel
PLDI
2000
ACM
15 years 11 months ago
Caching function calls using precise dependencies
This paper describes the implementation of a purely functional programming language for building software systems. In this language, external tools like compilers and linkers are ...
Allan Heydon, Roy Levin, Yuan Yu
FPL
2008
Springer
154views Hardware» more  FPL 2008»
15 years 8 months ago
Numerical function generators using bilinear interpolation
Two-variable numerical functions are widely used in various applications, such as computer graphics and digital signal processing. Fast and compact hardware implementations are re...
Shinobu Nagayama, Tsutomu Sasao, Jon T. Butler
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 11 months ago
Evolving hash functions by means of genetic programming
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...
César Estébanez, Julio César ...