200 search results - page 10 / 40 » Fast Computation of Reachability Labeling for Large Graphs |
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...
SSDBM
2010
IEEE
14 years 8 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
ISCSCT
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...