We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...
In classic InformationRetrieval systems a relevant document will not be retrieved in response to a query if the document and query representations do not share at least one term. T...
Resource selection is fundamental to the performance of master/slave applications. In this paper, we address the problem of promoting performance for distributed master/slave appl...
During the past few years, several studies have been made on the performance of real-time database systems with respect to the number of transactions that miss their deadlines. Th...
In this paper we evaluate the effectiveness of two likelihood normalization techniques, the Background Model Set (BMS) and the Universal Background Model (UBM), for improving perf...