922 search results - page 169 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
114
click to vote
AAAI
2010
15 years 3 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
104
Voted
ICONIP
2008
15 years 3 months ago
2008
Abstract. While injecting weight noise during training has been proposed for more than a decade to improve the convergence, generalization and fault tolerance of a neural network, ...
98
Voted
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...
127
Voted
NIPS
2007
15 years 3 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
120
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...