2808 search results - page 425 / 562 » Routing betweenness centrality |
151
click to vote
ISPD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
154
Voted
CIKM
2005
Springer
15 years 10 months ago
2005
Springer
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
193
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
181
click to vote
ESWS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper describes a real-time routing system that implements a mobile museum tour guide for providing personalized tours tailored to the user position inside the museu...
155
Voted
FPGA
2001
ACM
15 years 9 months ago
2001
ACM
A prototype platform has been developed that allows processing of packets at the edge of a multi-gigabit-per-second network switch. This system, the Field Programmable Port Extend...