Sciweavers

2743 search results - page 143 / 549
» Minimization of an M-convex Function
Sort
View
ACCV
2009
Springer
16 years 1 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...
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
16 years 1 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
ICC
2007
IEEE
16 years 23 days ago
Computing the Optimal Amount of Constellation Distortion in OFDM Systems
Abstract— The primary disadvantage of orthogonal frequencydivision multiplexing (OFDM) is the high time-domain peak-toaverage power ratio (PAR) that severely limits the transmitt...
Alok Aggarwal, Erik R. Stauffer, Teresa H. Meng
IJCNN
2007
IEEE
16 years 23 days ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin
GI
2007
Springer
16 years 18 days ago
A New Approach for Estimating Depth by Fusing Stereo and Defocus Information
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
Ioana Gheta, Christian Frese, Michael Heizmann, J&...