The need for video summarization originates primarily from a viewing time constraint. A shorter version of the original video sequence is desirable in a number of applications. Clearly, a shorter version is also necessary in applications where storage, communication bandwidth and/or power are limited. In this paper, our work is based on a MINMAX optimization formulation with viewing time, frame...

DOGMA is a new system for object-group-oriented parallel programming using Java. In addition to providing eeective object-group-oriented programming, DOGMA also provides powerful system connguration abilities such as dynamic code loading, dynamic system connguration, and web browser participation. Though relatively new, DOGMA has proven eeective at executing parallel applications on a several d...

The heterogeneous and dynamic nature of Grid environments place new demands on models and paradigms for parallel programming. In this work we discuss how ALua, a programming system based on a dual programming language model, can help the programmer to develop applications for this environment, monitoring the state of resources and controlling the application so that it adapts to changes in this...

Algorithms for comparing trees have recently been found relevant in the context of bioimage analysis. While previously proposed algorithms deal with problems that are computationally hard in general, we propose efficient algorithms for restricted versions that are able to handle significantly larger instances in practice. We propose two dynamic programming algorithms for the so-called tree assi...

FlexRay is getting popular among car makers to be used as a communication backbone for in-vehicle networking systems. It serves both time-triggered as well as event-triggered applications by maintaining static and dynamic segments in its communication cycle. There are many works on the scheduling of the signals that are motivated by different vehicular applications. In this survey the focus is ...

In many classes of continuous-time control problems coming from real world applications, control actions in the shape of jumps at certain instants can be useful to be considered. This technique is called impulsive control. The main idea is to split the continuous-time interval in some stages, performing control actions impulsively just in the instants among the stages, with the dynamic system k...

Irregular applications are critical to supporting grand challenge applications on massively parallel machines and extending the utility of those machines beyond the scientiic computing domain. The dominant parallel programmingmodels, data parallel and explicit message passing, provide little support for programming irregular applications. We articulate a set of requirements for supporting irreg...

According to the paradigm of Dynamic Logic Programming, knowledge is given by a set of theories (encoded as logic programs) representing different states of the world. Different states may represent time (as in updates), specificity (as in taxonomies), strength of the updating instance (as in the legislative domain), hierarchical position of knowledge source (as in organizations), etc. The mutu...

Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different principles. In the present note, we show how it is possible to combine the principles of two of these algorithms in order to design a hybrid dynamic programming...