The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva ...
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
Standard optical flow methods for motion or disparity estimation use a brightness constancy constraint equation (BCCE). This BCCE either handles a moving camera imaging a non-movi...
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
Focusing bistatic SAR data in frequency domain requires the two dimensional (2D) point target reference spectrum (PTRS). In this paper, a 2D PTRS is derived based on Loffeld’s b...