1772 search results - page 108 / 355 » Classifying Problems into Complexity Classes |
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
175
click to vote
OTM
2005
Springer
15 years 12 months ago
2005
Springer
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...
266
click to vote
NAACL
2010
15 years 4 months ago
2010
This paper proposes a general learning framework for a class of problems that require learning over latent intermediate representations. Many natural language processing (NLP) dec...
212
click to vote
LICS
2012
IEEE
13 years 8 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
160
click to vote
ECCC
2002
15 years 6 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...