Sciweavers

7924 search results - page 147 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
14 years 2 months ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
DCC
2010
IEEE
14 years 2 months ago
Modeling the Quantization Staircase Function
Quantization plays a central role in data compression. In speech systems, vector quantizers are used to compress speech parameters. In video systems, scalar quantizers are used to...
Salman Aslam, Aaron F. Bobick, Christopher F. Barn...
PKC
1999
Springer
96views Cryptology» more  PKC 1999»
14 years 1 months ago
How to Copyright a Function?
This paper introduces a method for tracking different copies of functionally equivalent algorithms containing identification marks known to the attacker. Unlike all previous solu...
David Naccache, Adi Shamir, Julien P. Stern
FCCM
1997
IEEE
129views VLSI» more  FCCM 1997»
14 years 1 months ago
The Chimaera reconfigurable functional unit
By strictly separating reconfigurable logic from their host processor, current custom computing systems suffer from a significant communication bottleneck. In this paper we descri...
Scott Hauck, Thomas W. Fry, Matthew M. Hosler, Jef...
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
14 years 19 days ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones