We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
We present a fully automatic lung lobe segmentation algorithm that is effective in high resolution computed tomography (CT) datasets in the presence of confounding factors such as ...
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...