299 search results - page 40 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
115
click to vote
ECRTS
2006
IEEE
15 years 3 months ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
Cost effective SOC test strongly hinges on parallel, independent test of SOC cores, which can only be ensured through proper core isolation techniques. While a core isolation mech...
SODA
2012
ACM
13 years 5 days ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...