895 search results - page 108 / 179 » Approximate convex decomposition |
121
click to vote
ISPD
1997
ACM
15 years 2 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
We consider a mixed linear system model, with both continuous and discrete inputs and outputs, described by a coefficient matrix and a set of noise variances. When the discrete inp...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
CGF
1999
14 years 9 months ago
1999
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
ML
2007
ACM
14 years 9 months ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...