390 search results - page 28 / 78 » Computing shortest paths for any number of hops |
113
Voted
ANCS
2009
ACM
14 years 11 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
140
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
128
Voted
EUROPAR
2009
Springer
15 years 8 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
118
Voted
ALGOSENSORS
2009
Springer
15 years 8 months ago
2009
Springer
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
98
Voted
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
In order to analyze shapes of continuous curves in R3 , we parameterize them by arc-length and represent them as curves on a unit two-sphere. We identify the subset denoting the cl...