In this paper, we study functions with low influences on product probability spaces. The
analysis of Boolean functions f {-1, 1}/sup n//spl rarr/{-1, 1} with low influences has become a …

This paper introduces a novel spectral framework for solving Markov decision processes
(MDPs) by jointly learning representations and optimal policies. The major components of …

We give the first polynomial time algorithm to learn any function of a constant number of
halfspaces under the uniform distribution on the Boolean hypercube to within any constant …

Boolean network models of molecular regulatory networks have been used successfully in
computational systems biology. The Boolean functions that appear in published models tend …

The satisfiability problem of propositional logic, SAT for short, is the first algorithmic problem
that was shown to be NP-complete, and is the cornerstone of virtually all NP-completeness …

This thesis is concerned with the study of the noise sensitivity of boolean functions and its
applications in theoretical computer science. Noise sensitivity is defined as follows: Let f be …

Caroline Melles: clarify definitions of various graph types (weighted graphs, multigraphs,
and weighted multigraphs); clarify definitions of degree, isolated vertices, and pendant and …

In a context of enhancing the performance of block encryption algorithms there are two well-
known approaches. The first one relates to the construction of block cipher modes of …

W. David Joyner Caroline Grant Melles Page 1 Applied and Numerical Harmonic Analysis W.
David Joyner Caroline Grant Melles Adventures in Graph Theory Page 2 Page 3 Applied and …

Representations are at the heart of artificial intelligence (AI). This book is devoted to the
problem of representation discovery: how can an intelligent system construct …