1192 search results - page 75 / 239 » Symbolic Query Exploration |
MFCS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
203
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
185
click to vote
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Research on query optimization has focused almost exclusively on reducing query execution time, while important qualities such as consistency and predictability have largely been ...
122
click to vote
IV
2003
IEEE
15 years 7 months ago
2003
IEEE
It is often useful to get high-level views of datasets in order to identify areas of interest worthy of further exploration. In relational databases, the high-level view can be de...
150
click to vote
ECCC
2011
14 years 5 months ago
2011
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...