Exploratory search, in which a user investigates complex concepts, is cumbersome with today’s search engines. We present a new exploratory search approach that generates interac...
Brent Hecht, Samuel Carton, Mahmood Quaderi, Johan...
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
In inter-picture coding, block-based frequency transform is usually carried out on the predicted errors for each interblock to remove the spatial correlation among them. However, ...
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
We introduce a methodology for obtaining inventories of error results for families of numerical dense linear algebra algorithms. The approach for deriving the analyses is goal-orie...