1064 search results - page 51 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
141
Voted
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
123
Voted
DAGSTUHL
2004
15 years 5 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
144
Voted
JC
2006
15 years 3 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
166
click to vote
KSEM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
145
Voted
MICAI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...