A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....
—Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms usi...
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...