994 search results - page 114 / 199 » Custom Computing Machines for the Set Covering Problem |
79
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
118
Voted
IJCNN
2008
IEEE
15 years 7 months ago
2008
IEEE
— Exploratory activities seem to be crucial for our cognitive development. According to psychologists, exploration is an intrinsically rewarding behaviour. The developmental robo...
112
click to vote
ICML
2004
IEEE
15 years 6 months ago
2004
IEEE
LASSO (Least Absolute Shrinkage and Selection Operator) is a useful tool to achieve the shrinkage and variable selection simultaneously. Since LASSO uses the L1 penalty, the optim...
106
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
91
Voted
SC
2009
ACM
15 years 7 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...