Sciweavers

2514 search results - page 64 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ACMIDC
2010
15 years 7 months ago
Querying and navigating a database of images with the magical objects of the wizard Zurlino
This work is part of a research targeted at experimenting the use of physical artifacts for the retrieval of multimedia information. Tangible interfaces
Fabio Pittarello, Riccardo Stecca
COOPIS
2004
IEEE
15 years 10 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
FOCS
1993
IEEE
15 years 10 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
EDBT
2008
ACM
147views Database» more  EDBT 2008»
16 years 6 months ago
BITPEER: continuous subspace skyline computation with distributed bitmap indexes
In this paper, we propose a bitmap approach for efficient subspace skyline computation in a distributed setting. Our approach computes extended skylines which have been shown to i...
Katerina Fotiadou, Evaggelia Pitoura
DBPL
2001
Springer
133views Database» more  DBPL 2001»
15 years 10 months ago
A Theory of Spatio-Temporal Database Queries
Abstract. We address a fundamental question concerning spatio-temporal database systems: “What are exactly spatio-temporal queries?” We define spatio-temporal queries to be co...
Floris Geerts, Sofie Haesevoets, Bart Kuijpers