52 search results - page 8 / 11 » A comparison of tight generalization error bounds |
102
click to vote
FSTTCS
1998
Springer
15 years 3 months ago
1998
Springer
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
SIAMCO
2000
14 years 10 months ago
2000
In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method ...
156
click to vote
CIS
2010
Springer
14 years 6 months ago
2010
Springer
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Vite...
ML
2002
ACM
14 years 10 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...