In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
1 As distributed systems scale up and are deployed into increasingly sensitive settings, demand is rising for a new generation of communications middleware in support of applicati...
Ken Birman, Mahesh Balakrishnan, Danny Dolev, Tudo...
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
We present recent results from the LCDM3 collaboration between UIUC Astronomy and NCSA to deploy supercomputing cluster resources and machine learning algorithms for the mining of ...
Nicholas M. Ball, Robert J. Brunner, Adam D. Myers
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...