Sciweavers

363 search results - page 40 / 73
» Linked Data Query Processing Strategies
Sort
View
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 5 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
TIP
2010
90views more  TIP 2010»
13 years 5 months ago
Fast Query for Exemplar-Based Image Completion
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
Tsz-Ho Kwok, Hoi Sheung, Charlie C. L. Wang
WWW
2004
ACM
14 years 11 months ago
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
Christoph Tempich, Steffen Staab, Adrian Wranik
AMR
2005
Springer
117views Multimedia» more  AMR 2005»
14 years 4 months ago
Learning User Queries in Multimodal Dissimilarity Spaces
Abstract. Different strategies to learn user semantic queries from dissimilarity representations of video audio-visual content are presented. When dealing with large corpora of vi...
Eric Bruno, Nicolas Moënne-Loccoz, Sté...
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
14 years 3 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...