Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
We present a manifold learning approach to dimensionality
reduction that explicitly models the manifold as a mapping
from low to high dimensional space. The manifold is
represen...
This paper presents a novel method for detecting scale
invariant keypoints. It fills a gap in the set of available
methods, as it proposes a scale-selection mechanism for
juncti...
Wolfgang F¨orstner, Timo Dickscheid, Falko Schind...
We introduce a new class of image features, the Ray feature set, that consider image characteristics
at distant contour points, capturing information which is difficult to repre...