1528 search results - page 165 / 306 » On Signatures for Communication Graphs |
189
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
166
click to vote
HOTNETS
2010
15 years 1 months ago
2010
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
185
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
178
click to vote
INFOCOM
2008
IEEE
16 years 21 days ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
182
click to vote
CRYPTO
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...