324 search results - page 55 / 65 » Bounds for Functions of Dependent Risks |
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
KR
2004
Springer
14 years 22 days ago
2004
Springer
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
CGO
2003
IEEE
14 years 21 days ago
2003
IEEE
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
FOCM
2006
13 years 7 months ago
2006
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...