Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, Davi...
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
Support Vector Regression (SVR) has been a long standing problem in machine learning, and gains its popularity on various computer vision tasks. In this paper, we propose a structu...