473 search results - page 47 / 95 » Computing shortest paths with uncertainty |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
—When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportional amount of relayin...
ECCV
2006
Springer
15 years 11 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...
100
click to vote
CAD
2004
Springer
14 years 9 months ago
2004
Springer
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...