6274 search results - page 314 / 1255 » From query complexity to computational complexity |
169
click to vote
ECOOP
1998
Springer
15 years 11 months ago
1998
Springer
Three nontrivial limitations of the existing JavaT M technology are considered from the viewpoint of object-oriented database technology. The limitations are: lack of support for o...
198
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...
131
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...
196
click to vote
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
—The ever increasing scale and complexity of large computational systems ask for sophisticated management tools, paving the way toward Autonomic Computing. A first step toward A...
158
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...