3368 search results - page 353 / 674 » The Complexity of Query Reliability |
200
click to vote
CASC
2009
Springer
15 years 7 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
197
click to vote
ICGI
2010
Springer
15 years 7 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
130
click to vote
RSA
2002
15 years 6 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
251
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...