Wavelet-based methods have proven their efficiency for the visualization at different levels of detail, progressive transmission, and compression of large data sets. The required...
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
In this paper, we present a controllable, fast and efficient particle system framework for skeletal implicit surfaces defined by the BlobTree model. We propose efficient algori...
We study functions with multiple output values, and use active sampling to identify an example for each of the possible output values. Our results for this setting include: (1) Eff...
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...