3341 search results - page 371 / 669 » On Bounded Queries and Approximation |
280
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
166
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
261
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
165
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
178
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
This paper is concerned with reachable set computation for non-linear systems using hybridization. The essence of hybridization is to approximate a non-linear vector field by a s...