Sciweavers

1994 search results - page 130 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
AIPS
2008
15 years 8 days ago
Generative Planning for Hybrid Systems Based on Flow Tubes
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
Hui X. Li, Brian C. Williams
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
15 years 7 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
IPPS
2006
IEEE
15 years 4 months ago
Analysis of a reconfigurable network processor
In this paper an analysis of a dynamically reconfigurable processor is presented. The network processor incorporates a processor and a number of coprocessors that can be connected...
Christopher Kachris, Stamatis Vassiliadis
PLDI
1990
ACM
15 years 2 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
COOPIS
1998
IEEE
15 years 2 months ago
A Dynamic and Adaptive Cache Retrieval Scheme for Mobile Computing
Recent advances in wireless technologies have made the mobile computing a reality. In order to provide services of good quality to mobile users and improve the system performance,...
Wen-Chih Peng, Ming-Syan Chen