In this paper, we propose a software architecture model for the development of elaboration/transcoding modules for structured data. We define a flexible implementation approach ...
Although workflow languages are widely used for composing discrete services, these are not suitable for stream based interactions. In this paper we address the problem of how to ...
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...