We describe in this paper a method for 3D shape indexing and retrieval that we apply on three data collections of the SHREC SHape Retrieval Contest 2008: Stability on watertight, ...
Thibault Napoleon, Tomasz Adamek, Francis Schmitt,...
FPGAs have appealing features such as customizable internal and external bandwidth and the ability to exploit vast amounts of fine-grain parallelism. In this paper we explore the ...
Text clustering is potentially very useful for exploration of text sets that are too large to study manually. The success of such a tool depends on whether the results can be expl...
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
The paper presents a concept, implementation and real examples of dynamic parallelization of computations using services derived from MPI applications deployed in the BeesyCluster ...