50 search results - page 9 / 10 » Quantum query complexity of minor-closed graph properties |
CVPR
1997
IEEE
13 years 10 months ago
1997
IEEE
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System , with an online user interface which is capable of identifying mult...
DIAGRAMS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
ESWS
2008
Springer
13 years 7 months ago
2008
Springer
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
STACS
2010
Springer
14 years 21 days 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...