In this paper we analyze the most popular evaluation metrics for separate-and-conquer rule learning algorithms. Our results show that all commonly used heuristics, including accur...
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
—This paper presents some preliminary experimental results on RegionBoost, which is a typical example of a class of Boosting algorithms based on dynamic weighting schemes. It is ...