2218 search results - page 197 / 444 » Testing Expressibility Is Hard |
DEXA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
ECAI
2004
Springer
14 years 4 months ago
2004
Springer
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...
ILP
2003
Springer
14 years 3 months ago
2003
Springer
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
CPAIOR
2010
Springer
14 years 3 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
ALT
2001
Springer
14 years 3 months ago
2001
Springer
We develop a theory for learning scenarios where multiple learners co-exist but there are mutual compatibility constraints on their outcomes. This is natural in cognitive learning...