In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
Background: Although many genomic features have been used in the prediction of proteinprotein interactions (PPIs), frequently only one is used in a computational method. After rea...
Jingchun Sun, Yan Sun, Guohui Ding, Qi Liu, Chuan ...
In this work, we present an approach to jointly segment a rigid object in a 2D image and estimate its 3D pose, using the knowledge of a 3D model. We naturally couple the two proces...
Samuel Dambreville, Romeil Sandhu, Anthony J. Yezz...
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
To ensure low power consumption while maintaining flexibility and performance, future Systems-on-Chip (SoC) will combine several types of processor cores and data memory units of...
Anthony Leroy, Paul Marchal, Adelina Shickova, Fra...