Sciweavers

467 search results - page 74 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
GG
2004
Springer
14 years 23 days ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
ICCV
2009
IEEE
15 years 10 days ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
ICPP
2006
IEEE
14 years 1 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
CVPR
2008
IEEE
14 years 9 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin
PRDC
2007
IEEE
14 years 1 months ago
Implementation of Highly Available OSPF Router on ATCA
This paper proposes a Highly-Available Open Shortest Path First (HA-OSPF) router which consists of two OSPF router modules-active and standby-to support a highavailability network...
Chia-Tai Tsai, Rong-Hong Jan, Chien Chen, Chia-Yua...