—In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of sw...
Mei Yang, Mayauna McCullough, Yingtao Jiang, Jun Z...
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
The iterative closest point (ICP) algorithm [2] is a popular method for modeling 3D objects from range data. The classical ICP algorithm rests on a rigid surface assumption. Build...
VLFeat is an open and portable library of computer vision algorithms. It aims at facilitating fast prototyping and reproducible research for computer vision scientists and student...
With the proliferation of applications sharing information represented in multiple ontologies, the development of automatic methods for robust and accurate ontology matching will ...
Montse Cuadros, Egoitz Laparra, German Rigau, Piek...