763 search results - page 58 / 153 » Engineering Shortest Path Algorithms |
CIC
2006
13 years 10 months ago
2006
We consider a video streaming application over P2P networks and introduce the P2P on-line server selection problem. This task is related to the classic K-server problem, known fro...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
SENSYS
2003
ACM
14 years 2 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 9 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...
VLDB
1998
ACM
14 years 1 months ago
1998
ACM
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...