, but not limited to: 1) Sophisticated video removal (of undesired static or dynamic objects) by completing the appropriate static or dynamic background information. 2) Correction of missing/corrupted video frames in old movies. 3) Modifying a visual story by replacing unwanted elements. 4) Creation of video

AND PREVIOUSWORK Sophisticated algorithms based on polyhedral algebra have been developed for determining good sequences of linear loop transformations (permutation, skewing, reversal and scaling) for enhancing locality in perfectly-nested loops 1. Highlights of this technology are the following. The iterations

A key component in any target or anomaly detection algorithm is the characterization of the background. We investigate several approaches for estimating the background level at a given pixel, based on both the local neighborhood around that pixel and on the global context of the full image

Complementarity solvers are continually being challenged by modelers demanding improved reliability and scalability. Building upon a strong theoretical background, the semismooth algorithm has the potential to meet both of these requirements. We briefly discuss relevant theory associated

by general economic conditions (e.g., times of high unemployment are correlated with increases in fraud losses due to lost 1060-3425/94 $3.00 0 1994 IEEE 621 and stolen cards). Fraud due to counterfeit cards has become a growing problem over the past several years, despite the more sophisticated card

deploying and operating a full system. Our experiments indicate that the tracking algorithms currently implemented in the DIB:S/TRAFEN system could detect attacks such as Code Red v2 and Sapphire/Slammer very early, even when monitoring a quite limited portion of the address space, but more sophisticated

. Additionally, when performing local collision avoidance, agents only need to take into account nearby obstacles and agents. Since the original algorithm uses a naïve method of neighbor selection, we will use a more sophisticated selection algorithm that takes into account an agent’s field of view

the background is cluttered and/or when occlusion occurs. Due to the lack of a good solution to this problem, many existing methods tend to be either effective but computationally intensive by using sophisticated image observation models or efficient but vulnerable to false alarms. This greatly challenges long

-tions on the available information is obtained analytically. We give tight bounds for the negative impact of TCP-based background transfer protocols compared to the optimal policy, and identify the range of system parameters for which more sophisticated congestion control makes a noticeable difference. Based

with linear orderings. To obtain nontrivial recommendations of actions and useful algorithms, additional assumptions need to be made: the scales for preferences and belief need to be interrelated, and a decisionmaking policy needs to be adopted, for example, a minimax policy. For discussion of this approach