Sciweavers

159 search results - page 8 / 32
» Codes identifying sets of vertices in random networks
Sort
View
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—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 ...
Jing Xia, Doina Caragea, William H. Hsu
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
13 years 8 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
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...
WONS
2012
IEEE
12 years 3 months ago
Obfuscating IEEE 802.15.4 communication using secret spreading codes
—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,...
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 9 months ago
Rumor Spreading on Random Regular Graphs and Expanders
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...
Nikolaos Fountoulakis, Konstantinos Panagiotou
ICDCSW
2005
IEEE
14 years 1 months ago
Visual Code Widgets for Marker-Based Interaction
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...
Michael Rohs