Sciweavers

2514 search results - page 174 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ECCV
2000
Springer
16 years 8 months ago
Learning Over Multiple Temporal Scales in Image Databases
Abstract. The ability to learn from user interaction is an important asset for content-based image retrieval (CBIR) systems. Over short times scales, it enables the integration of ...
Nuno Vasconcelos, Andrew Lippman
FOCS
1992
IEEE
15 years 10 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
DEBS
2011
ACM
14 years 10 months ago
DejaVu: a complex event processing system for pattern matching over live and historical data streams
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
Nihal Dindar, Peter M. Fischer, Nesime Tatbul
VLDB
2004
ACM
187views Database» more  VLDB 2004»
15 years 12 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
SAC
2005
ACM
16 years 3 days ago
Automatic wrapper maintenance for semi-structured web sources using results from previous queries
During the last years, significant attention has been paid to the problem of building wrappers for extracting data from semistructured web sources. Nevertheless, since web sources...
Juan Raposo, Alberto Pan, Manuel Álvarez, &...