17760 search results - page 15 / 3552 » A Generalization of the Massey-Ding Algorithm |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
GECCO
2003
Springer
14 years 29 days ago
2003
Springer
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
SSDBM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. Most correlation clustering algorithms rely on principal component analysis (PCA) as a correlation analysis tool. The correlation of each cluster is learned by applying P...
RSS
2007
13 years 9 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...