Sciweavers

3110 search results - page 123 / 622
» On the initialization of the DNMF algorithm
Sort
View
ACCV
2009
Springer
15 years 11 months ago
Planar Scene Modeling from Quasiconvex Subproblems
In this paper, we propose a convex optimization based approach for piecewise planar reconstruction. We show that the task of reconstructing a piecewise planar environment can be se...
Visesh Chari, Anil Kumar Nelakanti, Chetan Jakkoju...
121
Voted
ICPR
2010
IEEE
15 years 8 months ago
Accurate Dense Stereo by Constraining Local Consistency on Superpixels
Segmentation is a low-level vision cue often deployed by stereo algorithms to assume that disparity within superpixels varies smoothly. In this paper, we show that constraining, o...
Stefano Mattoccia
154
Voted
GD
2008
Springer
15 years 6 months ago
Topology Preserving Constrained Graph Layout
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
Tim Dwyer, Kim Marriott, Michael Wybrow
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 3 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
13 years 7 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns