2661 search results - page 125 / 533 » Quantum Complexity Classes |
142
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
137
click to vote
ERSHOV
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
120
click to vote
ECCC
2002
15 years 3 months ago
2002
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
142
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
The recognition of activities from sensory data is important in advanced surveillance systems to enable prediction of high-level goals and intentions of the target under surveilla...
222
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...