690 search results - page 29 / 138 » Dense Admissible Sets |
SCIA
2007
Springer
14 years 1 months ago
2007
Springer
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
PAMI
2011
13 years 2 months ago
2011
—Optical flow estimation is classically marked by the requirement of dense sampling in time. While coarse-to-fine warping schemes have somehow relaxed this constraint, there is...
DAM
2006
13 years 7 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
ECCC
2000
13 years 7 months ago
2000
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
ICDM
2003
IEEE
14 years 21 days ago
2003
IEEE
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...