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...
In this paper, several problems in associating hyperlinks to text and the diverse possibilities to overcome these problems are discussed. At the current stage, an important aspect ...
Ernst Georg Haffner, Andreas Heuer 0002, Uwe Roth,...
As modern organizations increasingly operate in a global economy, they need IT support around the globe; favorable economic conditions also encourage the use of offshore IT teams....
In medicine many exceptions occur. In medical practise and in knowledge-based systems too, it is necessary to consider them and to deal with them appropriately. In medical studies ...
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...