1026 search results - page 35 / 206 » On Finding Minimal w-cutset |
ACSC
2008
IEEE
13 years 11 months ago
2008
IEEE
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
CORR
2010
Springer
13 years 9 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...
VLSID
1996
IEEE
14 years 1 months ago
1996
IEEE
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set...
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...