2254 search results - page 186 / 451 » Computing the minimal covering set |
168
click to vote
IJCNN
2007
IEEE
16 years 28 days ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
172
click to vote
CONCUR
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
158
click to vote
EUC
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
163
click to vote
FPL
2005
Springer
16 years 5 days ago
2005
Springer
Abstract— Modern advances in reconfigurable analog technologies are allowing field-programmable analog arrays (FPAAs) to dramatically grow in size, flexibility, and usefulness...
160
click to vote
SCALESPACE
2005
Springer
16 years 3 days ago
2005
Springer
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...