1651 search results - page 14 / 331 » Measuring the Complexity of Classification Problems |
ALT
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior ...
IJCGA
2010
13 years 6 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
ENDM
2010
13 years 7 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
GPEM
2008
13 years 7 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
BMCBI
2005
13 years 7 months ago
2005
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...