A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(9...
— Computer vision algorithms are seeing increased use in industrial inspection applications. Here, we present an “Aid to Visual” system that can detect post deformations of l...
The combination of the famed kernel trick and the least-mean-square (LMS) algorithm provides an interesting sample by sample update for an adaptive filter in reproducing Kernel Hil...
Since the seminal work of Stein in the 1950s, there has been continuing research devoted to improving the total meansquared error (MSE) of the least-squares (LS) estimator in the l...