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 ...
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan K. ...
We introduce an interface for efficient video search that exploits the human ability to quickly scan visual content, after automatic retrieval has arrange the images in expected or...
Alexander G. Hauptmann, Wei-Hao Lin, Rong Yan, Jun...
Background: Gene-gene epistatic interactions likely play an important role in the genetic basis of many common diseases. Recently, machine-learning and data mining methods have be...
Xia Jiang, Richard E. Neapolitan, M. Michael Barma...
Much research effort on Automatic Image Annotation
(AIA) has been focused on Generative Model, due to its
well formed theory and competitive performance as compared
with many we...