A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
We present a simple and inexpensive method for computing the estimates of error in a hierarchical linear radiosity method. Similar to the approach used in 1 for constant radiosity ...