212 search results - page 10 / 43 » On convex formulation of the floorplan area minimization pro... |
CVPR
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— We consider the uplink power control problem where mobile users in different cells are communicating with their base stations. We formulate the power control problem as the min...
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
ICCV
2009
IEEE
15 years 26 days ago
2009
IEEE
In this paper, we address the problem of segmenting data defined on a manifold into a set of regions with uniform properties. In particular, we propose a numerical method when the ...
CIMAGING
2010
13 years 9 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...