The objective of the Shape Retrieval Contest '09 (SHREC'09) of Partial Models is to compare the performances of algorithms that accept a range image as the query and ret...
: Everyone realizes how powerful the few big Web search engine companies have become, both in terms of financial resources due to soaring stock quotes and in terms of the still hid...
Schemas, and more generally metadata specifying structural and semantic constraints, are invaluable in data management. They facilitate conceptual design and enable checking of da...
Peter M. Fischer, Kyumars Sheykh Esmaili, Ren&eacu...
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...