Sciweavers

895 search results - page 60 / 179
» Approximate convex decomposition
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Joint blind estimation of carrier phase and frequency offset for QAM signals using circular harmonic decomposition
An algorithm is presented for joint blind estimation of carrier phase and frequency offset for signals with quadrature amplitude modulation (QAM). The algorithm is based on a circ...
Alexander B. Sergienko, Alexander V. Petrov
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 1 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
CVPR
2008
IEEE
15 years 11 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
SIAMIS
2011
14 years 4 months ago
Locally Parallel Texture Modeling
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
Pierre Maurel, Jean-François Aujol, Gabriel...
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 1 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...