1772 search results - page 105 / 355 » Classifying Problems into Complexity Classes |
113
Voted
AAAI
1990
15 years 3 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
120
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
123
Voted
PR
2008
15 years 2 months ago
2008
It is generally believed that quadratic discriminant analysis (QDA) can better fit the data in practical pattern recognition applications compared to linear discriminant analysis ...
165
click to vote
TNN
2010
14 years 9 months ago
2010
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
115
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...