Sciweavers

866 search results - page 23 / 174
» On Dynamic Shortest Paths Problems
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
13 years 5 months ago
The asymmetric sinistral/dextral Markov-Dubins problem
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
Efstathios Bakolas, Panagiotis Tsiotras
NETWORKS
2007
13 years 7 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
GIS
2010
ACM
13 years 6 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
14 years 1 months ago
Restricted Shortest Path Routing with Concave Costs
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi