109 search results - page 14 / 22 » An Approximation Algorithm for Shortest Descending Paths |
120
click to vote
KDD
2004
ACM
15 years 5 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
112
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
14 years 12 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
COLOGNETWENTE
2008
15 years 1 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
ICIP
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
198
click to vote
GIS
2008
ACM
16 years 23 days ago
2008
ACM
Existing techniques for autonomous indoor navigation are often environment-specific and thus limited in terms of their applicability. In this paper, we take a fundamentally differ...