Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
In this paper, we study face hallucination, or synthesizing a high-resolution face image from an input low-resolution image, with the help of a large collection of other high-reso...
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...