Sciweavers

2814 search results - page 4 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
NIPS
2000
13 years 7 months ago
Learning Winner-take-all Competition Between Groups of Neurons in Lateral Inhibitory Networks
It has long been known that lateral inhibition in neural networks can lead to a winner-take-all competition, so that only a single neuron is active at a steady state. Here we show...
Xiaohui Xie, Richard H. R. Hahnloser, H. Sebastian...
STOC
1996
ACM
86views Algorithms» more  STOC 1996»
13 years 10 months ago
Modular Competitiveness for Distributed Algorithms
James Aspnes, Orli Waarts
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 6 months ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 3 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
ESA
2006
Springer
90views Algorithms» more  ESA 2006»
13 years 10 months ago
Competitive Analysis of Flash-Memory Algorithms
Avraham Ben-Aroya, Sivan Toledo