15033 search results - page 310 / 3007 » Complexity Theory and Algorithms |
166
click to vote
NIPS
2008
15 years 6 months ago
2008
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...
139
click to vote
JAIR
2008
15 years 5 months ago
2008
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...
165
click to vote
IJCV
2007
15 years 5 months ago
2007
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...
138
click to vote
TSP
2008
15 years 5 months ago
2008
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...
131
click to vote
TROB
2002
15 years 4 months ago
2002
This paper addresses the problem of achieving exact dynamic force control with manipulators possessing the low-level position and/or velocity controllers typically employed in indu...