4469 search results - page 108 / 894 » Dynamic Program Slicing |
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization prob...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
AINA
2009
IEEE
14 years 2 months ago
2009
IEEE
— Reprogramming node software over-the-air is an essential requirement in many wireless sensor network applications due to the inaccessibility of the deployed sensor nodes. Trans...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...