2309 search results - page 334 / 462 » Efficient Topological Exploration |
191
click to vote
JCM
2007
15 years 6 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
150
click to vote
TON
2008
15 years 6 months ago
2008
As the Internet infrastructure grows to support a variety of services, its legacy protocols are being overloaded with new functions such as traffic engineering. Today, operators en...
210
click to vote
CCR
2004
15 years 6 months ago
2004
Wireless sensor networks have attracted attention from a diverse set of researchers, due to the unique combination of distributed, resource and data processing constraints. Howeve...
195
click to vote
TPDS
2002
15 years 6 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
186
click to vote
PAMI
2007
15 years 6 months ago
2007
—Three-dimensional shape matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition, and classification. However,...