2473 search results - page 224 / 495 » The Logic of Communication Graphs |
184
click to vote
MOBICOM
2006
ACM
16 years 18 days ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
156
click to vote
INFOCOM
2005
IEEE
16 years 7 days ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
181
click to vote
IWDC
2005
Springer
16 years 4 days ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
193
click to vote
ICC
2007
IEEE
16 years 29 days ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
198
click to vote
AGP
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...