In this article, we focus our efforts (i) on the study of how to automatically extract and exploit visual concepts and (ii) on fast visual diversity. First, in the Visual Concept D...
Sabrina Tollari, Marcin Detyniecki, Ali Fakeri-Tab...
In this paper, we derive bounds on the Structural SIMilarity (SSIM) Index as a function of quantization rate for fixed-rate uniform quantization of image discrete cosine transform...
Sumohana S. Channappayya, Alan C. Bovik, Robert W....
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
Thomas J. Walsh, Sergiu Goschin, Michael L. Littma...
History Unwired (HU, see http://web.mit.edu/frontiers) is a multi-year investigation of the narrative uses of mobile technology in historic cities. In 2004-2005 a team of research...
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...