The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
This paper develops a weakly supervised algorithm that learns to segment rigid multi-colored objects from a set of training images and key points. The approach uses congealing to ...
Douglas Moore, John Stevens, Scott Lundberg, Bruce...
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...
Giovanni Bernardi, Michele Bugliesi, Damiano Maced...
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...