23 search results - page 3 / 5 » Domain Dependence in Parallel Constraint Satisfaction |
IPPS
2005
IEEE
13 years 12 months ago
2005
IEEE
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
ICDE
2007
IEEE
14 years 7 months ago
2007
IEEE
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
We propose a convex framework for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast as one...
PAMI
2011
13 years 1 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
AIPS
1994
13 years 7 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...