Sciweavers

5595 search results - page 702 / 1119
» Comparing Subsumption Optimizations
Sort
View
PAMI
1998
127views more  PAMI 1998»
15 years 7 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
PAMI
1998
124views more  PAMI 1998»
15 years 7 months ago
Robust Adaptive Segmentation of Range Images
—We propose a novel image segmentation technique using the robust, adaptive least kth order squares (ALKS) estimator which minimizes the kth order statistics of the squared of re...
Kil-Moo Lee, Peter Meer, Rae-Hong Park
PRL
1998
93views more  PRL 1998»
15 years 7 months ago
A connectionist method for pattern classification with diverse features
A novel connectionist method is proposed to simultaneously use diverse features in an optimal way for pattern classification. Unlike methods of combining multiple classifiers, a m...
Ke Chen 0001
ROBOTICA
2002
72views more  ROBOTICA 2002»
15 years 7 months ago
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
Shigang Yue, Dominik Henrich, W. L. Xu, S. K. Tso
RSA
2002
71views more  RSA 2002»
15 years 7 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski