3422 search results - page 70 / 685 » Random Subset Optimization |
102
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
161
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Manually labeled landmark sets are often required as in-
puts for landmark-based image registration. Identifying an
optimal subset of landmarks from a training dataset may be
us...
133
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
118
click to vote
JMLR
2006
15 years 2 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
113
Voted
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Quickest detection is applied in the spectrum sensing of cognitive radio systems when multiple secondary users collaborate with limited communication time slots. When t...