2657 search results - page 105 / 532 » On the complexity of hierarchical problem solving |
118
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
129
Voted
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
103
click to vote
AAAI
1990
15 years 2 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...
129
click to vote
TNN
2010
2010
Sensitivity versus accuracy in multiclass problems using memetic Pareto evolutionary neural networks
14 years 8 months ago
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high...