Sciweavers

50 search results - page 3 / 10
» On Unconstrained Quasi-Submodular Function Optimization
Sort
View
PR
2010
156views more  PR 2010»
13 years 5 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier
DCC
2008
IEEE
13 years 9 months ago
The Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions
We characterize the rate-distortion function for zero-mean stationary Gaussian sources under the MSE fidelity criterion and subject to the additional constraint that the distortio...
Milan S. Derpich, Jan Østergaard, Graham C....
JMLR
2010
129views more  JMLR 2010»
13 years 2 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
ICCV
2001
IEEE
14 years 9 months ago
Optimal Motion Estimation from Multiview Normalized Epipolar Constraint
In this paper, we study the structure from motion problem as a constrained nonlinear least squares problem which minimizes the so called reprojection error subject to all constrai...
René Vidal, Shankar Sastry, Shawn Hsu, Yi M...
NIPS
2004
13 years 8 months ago
Face Detection - Efficient and Rank Deficient
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...