We propose a methodology for automatically realizing communicative goals in graphics. It features a task model that mediates the communicative intent and the selection of graphica...
Stephan M. Kerpedjiev, Giuseppe Carenini, Nancy L....
It is shown that the best ASR results are attained when a pre-processing is carried out synchronically with pitch. Specifically, an analysis step has to be equal to the current one...
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Three nontrivial limitations of the existing JavaT M technology are considered from the viewpoint of object-oriented database technology. The limitations are: lack of support for o...
W e discuss the modification of queries against an integrated view in a federation of object-oriented databases. W epresent a generalisation of existing algorithms for simple glob...