Sciweavers

7522 search results - page 400 / 1505
» Spacing memetic algorithms
Sort
View
FOCM
2006
97views more  FOCM 2006»
15 years 7 months ago
Learning Rates of Least-Square Regularized Regression
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
Qiang Wu, Yiming Ying, Ding-Xuan Zhou
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 7 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
JMM2
2007
183views more  JMM2 2007»
15 years 7 months ago
A Chaos Theoretic Analysis of Motion and Illumination in Video Sequences
— Accurate and robust image motion detection has been of substantial interest in the image processing and computer vision communities. Unfortunately, no single motion detection a...
Michael E. Farmer
IJRR
2002
66views more  IJRR 2002»
15 years 7 months ago
Morse Decompositions for Coverage Tasks
Exact cellular decompositions represent a robot's free space by dividing it into regions with simple structure such that the sum of the regions fills the free space. These de...
Ercan U. Acar, Howie Choset, Alfred A. Rizzi, Pras...
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 8 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler