Sciweavers

881 search results - page 92 / 177
» connection 2004
Sort
View
NIPS
2004
15 years 6 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
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...
Massimiliano Pavan, Marcello Pelillo
NIPS
2004
15 years 6 months ago
Chemosensory Processing in a Spiking Model of the Olfactory Bulb: Chemotopic Convergence and Center Surround Inhibition
This paper presents a neuromorphic model of two olfactory signalprocessing primitives: chemotopic convergence of olfactory receptor neurons, and center on-off surround lateral inh...
Baranidharan Raman, Ricardo Gutierrez-Osuna
160
Voted
NIPS
2004
15 years 6 months ago
Learning, Regularization and Ill-Posed Inverse Problems
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...
Lorenzo Rosasco, Andrea Caponnetto, Ernesto De Vit...
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
15 years 6 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
UAI
2004
15 years 6 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown