Sciweavers

3328 search results - page 101 / 666
» On Plateaued Functions and Their Constructions
Sort
View
ECCC
2000
113views more  ECCC 2000»
13 years 10 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
SIAMCO
2000
75views more  SIAMCO 2000»
13 years 9 months ago
Feedback Stabilization and Lyapunov Functions
Given a locally defined, nondifferentiable but Lipschitz Lyapunov function, we construct a (discontinuous) feedback law which stabilizes the underlying system to any given toleran...
F. H. Clarke, Yu. S. Ledyaev, L. Rifford, R. J. St...
CVPR
2005
IEEE
15 years 2 days ago
Feature Kernel Functions: Improving SVMs Using High-Level Knowledge
Kernel functions are often cited as a mechanism to encode prior knowledge of a learning task. But it can be difficult to capture prior knowledge effectively. For example, we know ...
Qiang Sun, Gerald DeJong
DAC
2006
ACM
14 years 11 months ago
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
Jin S. Zhang, Alan Mishchenko, Robert K. Brayton, ...
ICFP
2004
ACM
14 years 10 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher