The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
We describe techniques for interactively controlling bipedal articulated figures through kinematic constraints. These constraints model certain behavioral tendencies which capture...
This paper presents a new approach to the issues of performance monitoring and visualization of distributed applications using the J-OCM monitoring system. We are focusing on the ...
Wlodzimierz Funika, Piotr Godowski, Piotr Pegiel, ...
We establish the following characteristics of the task of perspective classification: (a) using term frequencies in a document does not improve classification achieved with absenc...
Beata Beigman Klebanov, Eyal Beigman, Daniel Dierm...
This paper shows the results of an experiment in dialogue segmentation. In this experiment, segmentation was done on a level of analysis similar to adjacency pairs. The method of ...