Sciweavers

1485 search results - page 2 / 297
» Whole Program Paths
Sort
View
CCCG
1996
13 years 6 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
FGR
2006
IEEE
205views Biometrics» more  FGR 2006»
13 years 11 months ago
Tracking Using Dynamic Programming for Appearance-Based Sign Language Recognition
We present a novel tracking algorithm that uses dynamic programming to determine the path of target objects and that is able to track an arbitrary number of different objects. The...
Philippe Dreuw, Thomas Deselaers, David Rybach, Da...
SIGSOFT
1998
ACM
13 years 9 months ago
Effective Whole-Program Analysis in the Presence of Pointers
Understanding large software systems is difficult. Traditionally, automated tools are used to assist program understanding. However, the representations constructed by these tool...
Darren C. Atkinson, William G. Griswold
ASPLOS
2006
ACM
13 years 11 months ago
Tartan: evaluating spatial computation for whole program execution
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
Mahim Mishra, Timothy J. Callahan, Tiberiu Chelcea...