4052 search results - page 406 / 811 » Using RDF to describe networks |
157
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
196
click to vote
CCR
2008
15 years 7 months ago
2008
A key requirement for IETF recognition of new TCP algorithms is having an independent, interoperable implementation. This paper describes our BSD-licensed implementation of H-TCP ...
183
click to vote
DSN
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe the implementation and experimental evaluation of a fault-tolerant leader election service for dynamic systems. Intuitively, distributed applications can use this serv...
156
click to vote
SP
2006
IEEE
16 years 27 days ago
2006
IEEE
Hidden services were deployed on the Tor anonymous communication network in 2004. Announced properties include server resistance to distributed DoS. Both the EFF and Reporters Wit...
188
click to vote
IV
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a strategy for automatically mapping information onto visual parameters in the field of three-dimensional (3D) information visualization. The work presented h...