Sciweavers

3804 search results - page 494 / 761
» From Here to There
Sort
View
JGT
2007
68views more  JGT 2007»
15 years 6 months ago
Forcing highly connected subgraphs
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...
Maya Jakobine Stein
JMIV
2007
158views more  JMIV 2007»
15 years 6 months ago
On the Consistency of the Normalized Eight-Point Algorithm
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...
Wojciech Chojnacki, Michael J. Brooks
JMM2
2007
116views more  JMM2 2007»
15 years 6 months ago
Automatic Deformation Detection for Aircraft Engine Disk Inspection
— 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...
Dirk R. Padfield, Glen Brooksby, Robert Kaucic
165
Voted
TSP
2008
89views more  TSP 2008»
15 years 6 months ago
The Kernel Least-Mean-Square Algorithm
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...
Weifeng Liu, Puskal P. Pokharel, Jose C. Principe
TSP
2008
119views more  TSP 2008»
15 years 6 months ago
Universal Weighted MSE Improvement of the Least-Squares Estimator
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...
Yonina C. Eldar