390 search results - page 54 / 78 » Computing shortest paths for any number of hops |
140
click to vote
CPM
1993
Springer
15 years 6 months ago
1993
Springer
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re
ect the correct biolog...
162
click to vote
Publication
Ageometric framework for the recognition of three-dimensional objects represented by point
clouds is introducedin this paper. The proposed approach is based on comparing distribut...
118
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
135
click to vote
NPL
2007
15 years 1 months ago
2007
Autonomous mobile robots form an important research topic in the field of robotics due to their near-term applicability in the real world as domestic service robots. These robots ...
140
click to vote
CCGRID
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network ...