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 [...
Well-known approaches for the ontology mapping can be grouped into lexical, semantic, and structural ones. We assume that the approaches are complementary to each other and their ...
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
Philippe Jost, Pierre Vandergheynst, Pascal Frossa...
Background: It is becoming increasingly important for researchers to be able to scan through large genomic regions for transcription factor binding sites or clusters of binding si...
Dustin E. Schones, Andrew D. Smith, Michael Q. Zha...
We present a real-time approach for image-based localization within large scenes that have been reconstructed offline using structure from motion (Sfm). From monocular video, our...
Hyon Lim, Sudipta N. Sinha, Michael F. Cohen, Matt...