Sciweavers

360 search results - page 28 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
137
Voted
POLICY
2005
Springer
15 years 12 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
169
Voted
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 10 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
272
Voted
VLDB
2004
ACM
119views Database» more  VLDB 2004»
16 years 6 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
174
Voted
ICIP
2003
IEEE
16 years 8 months ago
Design of Q-shift complex wavelets for image processing using frequency domain energy minimization
This paper proposes a new method of designing finitesupport wavelet filters, based on minimization of energy in key parts of the frequency domain. In particular this technique is ...
Nick G. Kingsbury
163
Voted
WEBDB
2005
Springer
107views Database» more  WEBDB 2005»
15 years 12 months ago
Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web
The dynamics of the Web and the demand for new, active services are imposing new requirements on Web servers. One such new service is the processing of continuous queries whose ou...
Mohamed A. Sharaf, Alexandros Labrinidis, Panos K....