Communication in the face of intermittent, short-lived and unreliable connectivity can be difficult when relying solely on Internet protocols which have an implicit assumption of...
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
We studied the dynamics of a neural network which have both of recurrent excitatory and random inhibitory connections. Neurons started to become active when a relatively weak trans...
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
The evolution of language implies the parallel evolution of an ability to respond appropriately to signals (language understanding) and an ability to produce the appropriate signa...