Sciweavers

3328 search results - page 125 / 666
» On Plateaued Functions and Their Constructions
Sort
View
AI
1999
Springer
15 years 6 months ago
Topological Inference of Teleology: Deriving Function from Structure via Evidential Reasoning
Reasoning about the physical world is a central human cognitive activity. One aspect of such reasoning is the inference of function from the structure of the artifacts one encount...
John O. Everett
TNN
2010
155views Management» more  TNN 2010»
15 years 1 months ago
Incorporating the loss function into discriminative clustering of structured outputs
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
Wenliang Zhong, Weike Pan, James T. Kwok, Ivor W. ...
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
16 years 6 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio
LICS
2009
IEEE
16 years 1 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos
FSE
2005
Springer
106views Cryptology» more  FSE 2005»
15 years 12 months ago
New Applications of T-Functions in Block Ciphers and Hash Functions
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
Alexander Klimov, Adi Shamir