154 search results - page 16 / 31 » Robust snake convergence based on dynamic programming |
104
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
145
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
113
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
220
Voted
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
105
click to vote
ACCV
2009
Springer
15 years 8 months ago
2009
Springer
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...