A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
In this paper we propose a novel method to recover the 3D shape of the knee and of the prosthesis for the patients that have undergone total knee replacement surgery. We address t...
Mihai Sardarescu, Nikos Paragios, Nikos Komodakis,...