Sciweavers

17760 search results - page 316 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
NIPS
2003
15 years 8 months ago
A Biologically Plausible Algorithm for Reinforcement-shaped Representational Learning
Significant plasticity in sensory cortical representations can be driven in mature animals either by behavioural tasks that pair sensory stimuli with reinforcement, or by electro...
Maneesh Sahani
174
Voted
IJON
2006
99views more  IJON 2006»
15 years 6 months ago
Learning vector quantization: The dynamics of winner-takes-all algorithms
Winner-Takes-All (WTA) prescriptions for Learning Vector Quantization (LVQ) are studied in the framework of a model situation: Two competing prototype vectors are updated accordin...
Michael Biehl, Anarta Ghosh, Barbara Hammer
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 1 months ago
On Approximating the Average Distance Between Points
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Kfir Barhum, Oded Goldreich, Adi Shraibman