1026 search results - page 20 / 206 » On Finding Minimal w-cutset |
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
It is a well known classical result that given the image projections of three known world points it is possible to solve for the pose of a calibrated perspective camera to up to f...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
ISPD
2000
ACM
14 years 1 months ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
ISHPC
2003
Springer
14 years 2 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract-- This paper concerns the power minimization problem in server farms. The power minimization problem over dynamic power allocation schemes is formally defined and formulat...