3341 search results - page 126 / 669 » On Bounded Queries and Approximation |
FORMATS
2007
Springer
15 years 4 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
174
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
190
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...