478 search results - page 7 / 96 » Convexity minimizes pseudo-triangulations |
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
In this paper we present two results on reducing the peak power of orthogonal frequency division multiplexing (OFDM) symbols via constellation extension (CE). The first result is...
JGO
2010
13 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
SDM
2010
SIAM
13 years 5 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
ISPD
1998
ACM
13 years 11 months ago
1998
ACM
It is shown that the oorplan area minimization problem can be formulated as a convex programming problem with the numbers of variables and constraints signi cantly less than those...