A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
Abstract--We investigate the problem of finding minimum-distortion policies for streaming delay-sensitive but distortion-tolerant data. We consider cross-layer approaches which exp...
Defining ontologies within the multimedia domain still remains a challenging task, due to the complexity of multimedia data and the related associated knowledge. In this paper, we...
Vincenzo Moscato, Antonio Penta, Fabio Persia, Ant...
One problem many Web users encounter is to keep track of changes of distant Web sources. Push services, informing clients about data changes, are frequently not provided by Web ser...
The Context Interchange Project presents a unique approach to the problem of semantic conflict resolution among multiple heterogeneous data sources. The system presents a semantic...