3341 search results - page 52 / 669 » On Bounded Queries and Approximation |
IPL
2000
14 years 9 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
WAIM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The heterogeneity nature of XML data creates the need for approximate query answering. In this paper, we present an XML system that cooperates with users to provide user-...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
STOC
2003
ACM
15 years 10 months ago
2003
ACM
