1528 search results - page 280 / 306 » On Signatures for Communication Graphs |
148
click to vote
PRDC
2009
IEEE
15 years 8 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
128
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...
120
click to vote
COMSWARE
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
102
click to vote
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
133
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...