—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
—The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading ...
Bjorn Muntwyler, Vincent Lenders, Franck Legendre,...
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
We present a set of graphical user interface elements, called widgets, for 2-dimensional visual codes. The proposed widgets are suitable for printing on paper as well as showing o...