299 search results - page 13 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
JAR
2008
13 years 7 months ago
2008
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
SIAMREV
2010
13 years 2 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
TWC
2008
13 years 7 months ago
2008
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
Convex relaxation techniques have become a popular approach to image segmentation as they allow to compute solutions independent of initialization to a variety of image segmentati...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
We present a novel approach that minimizes the power consumption of embedded core-based systems through hardware/software partitioning. Our approach is based on the idea of mapping...