Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Restoring a clear image from a single motion-blurred
image due to camera shake has long been a challenging
problem in digital imaging. Existing blind deblurring techniques
eithe...
Jian-Feng Cai (National University of Singapore), ...
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...
We present an algorithm for video retrieval that fuses the decisions of multiple retrieval agents in both text and image modalities. While the normalization and combination of evi...