3341 search results - page 120 / 669 » On Bounded Queries and Approximation |
248
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
134
click to vote
FUIN
2006
15 years 4 months ago
2006
In this paper we derive the bounds for Validation (known also as Hold-Out Estimate and Train-and-Test Method). We present the best possible bound in the case of 0-1 valued loss fun...
121
click to vote
MP
2006
15 years 4 months ago
2006
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
147
click to vote
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
118
click to vote
UAI
2004
15 years 5 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...