1416 search results - page 87 / 284 » The Kernel Least-Mean-Square Algorithm |
CJ
2008
14 years 10 months ago
2008
A survey of the most important and general techniques in parameterized algorithm design is given. Each technique is explained with a meta-algorithm, its use is illustrated by exam...
109
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
We consider the problem of decentralized detection under constraints on the number of bits that can be transmitted by each sensor. In contrast to most previous work, in which the ...
MLDM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel unsupervised algorithm for outlier detec...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...