Sciweavers

4507 search results - page 134 / 902
» Generalized Binet dynamics
Sort
View
IJON
2006
99views more  IJON 2006»
15 years 4 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
JSAC
2006
79views more  JSAC 2006»
15 years 4 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
SIGMETRICS
2008
ACM
15 years 4 months ago
Network distance estimation with dynamic landmark triangles
This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-di...
Zhihua Wen, Michael Rabinovich
JCP
2007
143views more  JCP 2007»
15 years 4 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
TOG
2008
121views more  TOG 2008»
15 years 4 months ago
Superimposing dynamic range
Replacing a uniform illumination by a high-frequent illumination enhances the contrast of observed and captured images. We modulate spatially and temporally multiplexed (projected...
Oliver Bimber, Daisuke Iwai