Sciweavers

6110 search results - page 338 / 1222
» Approximate Computing
Sort
View
CVPR
2011
IEEE
15 years 2 months ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...
Stefanie Jegelka, Jeff Bilmes
ICML
2010
IEEE
15 years 7 months ago
Learning the Linear Dynamical System with ASOS
We develop a new algorithm, based on EM, for learning the Linear Dynamical System model. Called the method of Approximated Second-Order Statistics (ASOS) our approach achieves dra...
James Martens
ECCV
2008
Springer
16 years 8 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
CVPR
2000
IEEE
16 years 8 months ago
Curve and Surface Reconstruction from Regular and Non-Regular Point Sets
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
Edmond Boyer, Sylvain Petitjean
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld