1142 search results - page 147 / 229 » Approximability of Clausal Constraints |
162
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
160
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
189
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...
159
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
168
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
The problem of transmit beamforming for single-group multicasting is considered, where the objective is to transmit common information to a (large) number of users. The transmitte...