Sciweavers

552 search results - page 84 / 111
» Constrained Shortest Path Computation
Sort
View
ICPP
2006
IEEE
15 years 3 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
IUI
2009
ACM
15 years 6 months ago
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
Melinda T. Gervasio, Janet L. Murdock
CVPR
2008
IEEE
15 years 11 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
CHI
2011
ACM
14 years 1 months ago
TorusDesktop: pointing via the backdoor is sometimes shorter
When pointing to a target on a computer desktop, we may think we are taking the shortest possible path. But new shortcuts become possible if we allow the mouse cursor to jump from...
Stéphane Huot, Olivier Chapuis, Pierre Drag...
PRDC
2007
IEEE
15 years 3 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...