995 search results - page 91 / 199 » nips 2007 |
84
Voted
NIPS
2001
15 years 2 months ago
2001
We describe a neural network which enhances and completes salient closed contours. Our work is different from all previous work in three important ways. First, like the input prov...
107
Voted
NIPS
2001
15 years 2 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
111
Voted
NIPS
2001
15 years 2 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
118
click to vote
NIPS
2003
15 years 2 months ago
2003
We consider the problem of reconstructing patterns from a feature map. Learning algorithms using kernels to operate in a reproducing kernel Hilbert space (RKHS) express their solu...
101
Voted
NIPS
2003
15 years 2 months ago
2003
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...