In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...
Mehmet Ercan Yildiz, Anna Scaglione, Asuman E. Ozd...
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
With the growth in sociality and interaction around online news media, news sites are increasingly becoming places for communities to discuss and address common issues spurred by ...
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...