4757 search results - page 520 / 952 » Monads for Functional Programming |
183
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
147
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
324
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
159
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...
195
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
— Small gates, such as AND2, XOR2 and MUX2, have been mixed with lookup tables (LUTs) inside the programmable logic block (PLB) to reduce area and power and increase performance ...