Sciweavers

486 search results - page 53 / 98
» What was the Query
Sort
View
136
Voted
3DOR
2009
15 years 6 months ago
SHREC 2009 - Shape Retrieval Contest
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...
Remco C. Veltkamp, Frank B. ter Haar
JUCS
2006
225views more  JUCS 2006»
15 years 5 months ago
Restricting the View and Connecting the Dots - Dangers of a Web Search Engine Monopoly
: 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...
Narayanan Kulathuramaiyer, Wolf-Tilo Balke
EDBT
2010
ACM
208views Database» more  EDBT 2010»
15 years 12 months ago
Stream schema: providing and exploiting static metadata for data stream processing
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...
FOCS
2009
IEEE
15 years 11 months ago
Distance Oracles for Sparse Graphs
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...
Christian Sommer 0002, Elad Verbin, Wei Yu
INFOCOM
2006
IEEE
15 years 11 months ago
Theory and Network Applications of Dynamic Bloom Filters
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...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo