1416 search results - page 199 / 284 » The Kernel Least-Mean-Square Algorithm |
173
click to vote
RTSS
1992
IEEE
15 years 8 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
155
Voted
NIPS
2008
15 years 5 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
122
click to vote
NIPS
2007
15 years 5 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
166
click to vote
JMLR
2006
15 years 4 months ago
2006
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
149
click to vote
ISORC
2002
IEEE
15 years 9 months ago
2002
IEEE
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...