In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
To provide performant access to data from high energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dy...
Caitriana Nicholson, David G. Cameron, A. T. Doyle...
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...