11160 search results - page 123 / 2232 » Incompleteness in a General Setting |
110
Voted
ALT
2004
Springer
15 years 9 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
112
Voted
ICCBR
2007
Springer
15 years 6 months ago
2007
Springer
The aim of this paper is to analyze how the generalizations built by a CBR method can be used as local approximations of a concept. From this point of view, these local approximati...
88
Voted
ESANN
2007
15 years 2 months ago
2007
Collaborative Filtering (CF) aims at finding patterns in a sparse matrix of contingency. It can be used for example to mine the ratings given by users on a set of items. In this p...
72
Voted
ESANN
2006
15 years 2 months ago
2006
In this paper we demonstrate the generalization property of spiking neurons trained with ReSuMe method. We show in a set of experiments that the learning neuron can approximate the...
CORR
2010
Springer
15 years 23 days ago
2010
Springer
: This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balanc...