Sciweavers

2816 search results - page 189 / 564
» Submodular function minimization
Sort
View
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
15 years 10 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song
101
Voted
ACCV
2009
Springer
15 years 7 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...
112
Voted
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
15 years 7 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...
85
Voted
ICC
2007
IEEE
15 years 7 months 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
106
Voted
IJCNN
2007
IEEE
15 years 7 months 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