2063 search results - page 148 / 413 » connection 2007 |
144
click to vote
NIPS
2004
15 years 5 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
131
click to vote
NIPS
2004
15 years 5 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
134
click to vote
NIPS
2004
15 years 5 months ago
2004
This paper presents a neuromorphic model of two olfactory signalprocessing primitives: chemotopic convergence of olfactory receptor neurons, and center on-off surround lateral inh...
151
click to vote
NIPS
2004
15 years 5 months ago
2004
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
124
click to vote
NIPS
2001
15 years 5 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...