We present a scheme for simultaneous calibration of a continuously moving and continuously zooming camera: placing an easily distinguishable pattern in the scene, we calibrate the camera from an unoccluded portion of the pattern image in each frame. We describe an optimal method which provides an evaluation of the reliability of the solution. We then propose a technique for avoiding the inheren...

Suppose now that instead of placing each ball in a single random bin, we choose d random bins for each ball, place it in the one that currently has fewest balls, and proceed in this manner sequentially for each ball. Clearly if d = n the maximum load will be optimal: dm/ne. But this requires global knowledge of the state of all bins. Today we will show that with d = 2 choices, the maximum load ...

We present a scheme for simultaneous calibration of a continuously moving and continuously zooming camera: placing an easily distinguishable pattern in the scene, we calibrate the camera from an unoccluded portion of the pattern image in each frame. We describe an optimal method which provides an evaluation of the reliability of the solution. We then propose a technique for avoiding the inheren...

Methods Our group consisted of 35 inoperable patients presenting aortic valve disease unsuitable for transfemoral valve implantation due to extreme peripheral vessel disease. Data were prospectively collected and retrospectively analysed. Using an upper-J mini sternotomy access to the third intercostal space the ascending aorta was exposed. After placing two purse-strings on the ascending aorta...

Neurological and neurosurgical diseases lead to complications producing malnutrition increasing pathology and mortality. In order to avoid complications because of malnutrition or overcome deficiencies in nutrients supplements are often used for these subjects. The physiopathological mechanisms of malnutrition, methods of nutritional assessment and the supplemental support are reviewed in this ...

This paper presents a new technique for the optimum placement of processors to minimize the total effective communication load under multi-processor communication dominated environment. This is achieved by placing heavily loaded processors near each other and lightly loaded ones far away from one another in the physical grid locations. The results are mathematically proved for the Algorithms ar...

We present the first constant-factor approximation algorithm for a non-trivial instance of the optimal guarding (coverage) problem in polygons. In particular, we give an O(1)-approximation algorithm for placing the fewest point guards on a 1.5D terrain, so that every point of the terrain is seen by at least one guard. While polylogarithmic-factor approximations follow from set cover results, ou...