Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Jun Zhang, Nikos Mam...
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, ...
This study examines the facets and patterns of multiple Web query reformulations with a focus on reformulation sequences. Based on IR interaction models, it was presumed that quer...
Motivated by the hypothesis that the retrieval performance of a weighting model is independent of the language in which queries and collection are expressed, we compared the retrie...
Previous research on cluster-based retrieval has been inconclusive as to whether it does bring improved retrieval effectiveness over document-based retrieval. Recent developments ...