The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Writer independent handwriting recognition systems are limited in their accuracy, primarily due the large variations in writing styles of most characters. Samples from a single ch...
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
In this paper, we demonstrate an integrated registration and clustering algorithm to compute an atlas of fiberbundles from a set of multi-subject diffusion weighted MR images. We ...
Ulas Ziyan, Mert R. Sabuncu, W. Eric L. Grimson, C...