Zobrazeno 1 - 10
of 397
pro vyhledávání: '"Wan, Andrew"'
Autor:
Du, Chan, Choy, Kelene K.L., Chew, Lamony J.M., Antipina, Maria N., Chng, Valerie J.Y., Su, Sebastian H.A., Tai, Benjamin C.U., Osen, Raffael, Sugii, Shigeki, Wan, Andrew C.A.
Publikováno v:
In Journal of Food Engineering November 2023 357
Autor:
Chng, Valerie J.Y., Wan, Andrew C.A.
Publikováno v:
In Journal of Food Engineering November 2023 357
We give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O'Donnell and Servedio for regular decision trees. We use this bound to
Externí odkaz:
http://arxiv.org/abs/1506.01055
We present an approach to extract measured information from text (e.g., a 1370 degrees C melting point, a BMI greater than 29.9 kg/m^2 ). Such extractions are critically important across a wide range of domains - especially those involving search and
Externí odkaz:
http://arxiv.org/abs/1505.01072
We present an explicit pseudorandom generator for oblivious, read-once, width-$3$ branching programs, which can read their input bits in any order. The generator has seed length $\tilde{O}( \log^3 n ).$ The previously best known seed length for this
Externí odkaz:
http://arxiv.org/abs/1405.7028
A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean functions, where we
Externí odkaz:
http://arxiv.org/abs/1405.5268
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Given $f:\{-1, 1\}^n \rightarrow \{-1, 1\}$, define the \emph{spectral distribution} of $f$ to be the distribution on subsets of $[n]$ in which the set $S$ is sampled with probability $\widehat{f}(S)^2$. Then the Fourier Entropy-Influence (FEI) conje
Externí odkaz:
http://arxiv.org/abs/1312.3003
We show that, if truth assignments on $n$ variables reproduce through recombination so that satisfaction of a particular Boolean function confers a small evolutionary advantage, then a polynomially large population over polynomially many generations
Externí odkaz:
http://arxiv.org/abs/1312.1983
Autor:
Loo, Yihua1 (AUTHOR), Wan, Andrew C. A.1 (AUTHOR), Hauser, Charlotte A. E.1,2 (AUTHOR), Lane, E. Birgitte3,4 (AUTHOR), Benny, Paula3 (AUTHOR) a0018373@u.nus.edu
Publikováno v:
FASEB Bioadvances. Oct2022, Vol. 4 Issue 10, p631-637. 7p.