E
Eric Blais
Researcher at University of Waterloo
Publications - 79
Citations - 1689
Eric Blais is an academic researcher from University of Waterloo. The author has contributed to research in topics: Boolean function & Property testing. The author has an hindex of 18, co-authored 77 publications receiving 1515 citations. Previous affiliations of Eric Blais include McGill University & Autodesk.
Papers
More filters
Proceedings Article
Tolerant junta testing and the connection to submodular optimization and function isomorphism
TL;DR: In this article, the authors considered the problem of tolerant testing of k-juntas, where the testing algorithm must accept any function that is ϵ-close to some k-Junta and reject any functions that are ϵ'-far from every kJunta for some ϵ' = O(ϵ) and k' = o(k).
Journal ArticleDOI
A Polynomial Lower Bound for Testing Monotonicity
Aleksandrs Belovs,Eric Blais +1 more
TL;DR: In this paper, it was shown that every algorithm for testing $n$-variate Boolean functions for monotonicity must have query complexity (in the form of query complexity) at least tilde{Omega(n 1/4}(n −1/4).
Patent
Graphics Processing Method and System
Ian R. Ameline,Eric Blais +1 more
TL;DR: In this article, the authors proposed a method for anti-aliasing in flood filling by assigning alpha values to pixels in gaps between corners of the fill region, where an alpha value may be proportional to a point's contribution to the gap.
Posted Content
A New Minimax Theorem for Randomized Algorithms
Shalev Ben-David,Eric Blais +1 more
TL;DR: A new type of minimax theorem is introduced which can provide a hard distribution that works for all bias levels at once and is used to analyze low-bias randomized algorithms by viewing them as "forecasting algorithms" evaluated by a proper scoring rule.
Journal ArticleDOI
Approximating Boolean Functions with Depth-2 Circuits
Eric Blais,Li-Yang Tan +1 more
TL;DR: Using Fourier analytic tools, the techniques extend broadly to give strong universal upper bounds on approximability by various depth-2 circuits that generalize DNFs, including the intersection of halfspaces, low-degree PTFs, and unate functions.