1651 search results - page 154 / 331 » Measuring the Complexity of Classification Problems |
113
Voted
IJCAI
2007
15 years 3 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
130
click to vote
HIPC
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...
148
click to vote
DAM
2002
15 years 2 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
137
click to vote
ML
2000
ACM
15 years 2 months ago
2000
ACM
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
139
Voted
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...