In many applications, replacing a complex word form by its stem can reduce sparsity, revealing connections in the data that would not otherwise be apparent. In this paper, we focu...
Shane Bergsma, Aditya Bhargava, Hua He, Grzegorz K...
A number of image set compression algorithms have been proposed in the literature. A key component of these algorithms is a numeric measure used to quantify how similar two images ...
In this paper we present a hybrid filtering algorithm that attempts to deal with low prediction Coverage, a problem especially present in sparse datasets. We focus on Item HyCoV, a...
Manolis G. Vozalis, Angelos I. Markos, Konstantino...
Grassmannian beamforming is an efficient way to quantize channel state information in multiple-input multiple-output wireless systems. Unfortunately, multiuser systems require la...
Many location-based services require rich and expressive query language support for filtering large amounts of information. In prominent location-based services thousands of conti...