Sciweavers

473 search results - page 73 / 95
» Computing shortest paths with uncertainty
Sort
View
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
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...
ICPP
2005
IEEE
15 years 3 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann
69
Voted
DAC
2004
ACM
15 years 3 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong