Sciweavers

16430 search results - page 701 / 3286
» On Computable Tree Functions
Sort
View
FSE
2004
Springer
113views Cryptology» more  FSE 2004»
16 years 20 days ago
Minimum Distance between Bent and 1-Resilient Boolean Functions
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
Soumen Maity, Subhamoy Maitra
IFIP13
2004
15 years 8 months ago
Analysing Dynamic Function Scheduling Decisions
: Function allocation, as a process used in the construction of dependable complex systems, is a significant aspect of the design and implementation of interactive systems. It invo...
Karsten Loer, Michael Hildebrandt, Michael D. Harr...
COLT
2005
Springer
16 years 25 days ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth
DATE
1998
IEEE
100views Hardware» more  DATE 1998»
15 years 11 months ago
Combinational Verification based on High-Level Functional Specifications
We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main id...
Evguenii I. Goldberg, Yuji Kukimoto, Robert K. Bra...
175
Voted
AAAI
2007
15 years 9 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang