Search
Now showing items 1-9 of 9
Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
(MIT Press - Journals, 2019)
© 2019 Massachusetts Institute of Technology. Winner-take-all (WTA) refers to the neural operation that selects a (typ-ically small) group of neurons from a large neuron pool. It is conjectured to underlie many of the ...
Brief announcement: On simple back-off in unreliable radio networks
(2018)
© Seth Gilbert, Nancy Lynch, Calvin Newport, and Dominik Pajak. In this paper, we study local broadcast in the dual graph model, which describes communication in a radio network with both reliable and unreliable links. ...
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory
(Association for Computing Machinery (ACM), 2019)
<jats:p>We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual learns the best option if eventually ...
Task-structured probabilistic I/O automata
(Elsevier BV, 2018)
© 2017 Elsevier Inc. Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims ...
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
(ACM, 2017-07-25)
© 2017 Association for Computing Machinery. Motivated by emerging applications to the edge computing paradigm, we introduce a two-layer erasure-coded fault-tolerant distributed storage system offering atomic access for ...
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
(Association for Computing Machinery (ACM), 2016-07)
© 2016 ACM. The focus of this paper is to understand storage costs of em- ulating an atomic shared memory over an asynchronous, dis- tributed message passing system. Previous literature has de- veloped several shared memory ...
RADON: Repairable Atomic Data Object in Networks
(2017)
© Kishori M. Konwar, N. Prakash, Nancy A. Lynch, and Muriel Medard. Erasure codes offer an efficient way to decrease storage and communication costs while implementing atomic memory service in asynchronous distributed ...
Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks
(2017)
© Nancy Lynch, Cameron Musco, and Merav Parter;. We study distributed algorithms implemented in a simplified biologically inspired model for stochastic spiking neural networks. We focus on tradeoffs between computation ...
Searching without communicating: tradeoffs between performance and selection complexity
(Springer Nature, 2017)
© 2016, Springer-Verlag Berlin Heidelberg. We consider the ANTS problem (Feinerman et al.) in which a group of agents collaboratively search for a target in a two-dimensional plane. Because this problem is inspired by the ...