Sciweavers

1258 search results - page 110 / 252
» Architecture-driven Problem Decomposition
Sort
View
DCG
1998
53views more  DCG 1998»
13 years 8 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
TIP
2002
98views more  TIP 2002»
13 years 8 months ago
Joint-MAP Bayesian tomographic reconstruction with a gamma-mixture prior
We address the problem of Bayesian image reconstruction with a prior that captures the notion of a clustered intensity histogram. The problem is formulated in the framework of a j...
Ing-Tsung Hsiao, Anand Rangarajan, Gene Gindi
CVPR
2012
IEEE
11 years 11 months ago
Coupling detection and data association for multiple object tracking
We present a novel framework for multiple object tracking in which the problems of object detection and data association are expressed by a single objective function. The framewor...
Zheng Wu, Ashwin Thangali, Stan Sclaroff, Margrit ...
GI
2007
Springer
14 years 29 days ago
Coordination of Interdependent Planning Systems, a Case Study
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
Leif Meier, René Schumann
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 9 months ago
Minimum cost distributed source coding over a network
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Aditya Ramamoorthy