29 search results - page 5 / 6 » Random Projection Trees Revisited |
MCS
2007
Springer
13 years 11 months ago
2007
Springer
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
FOCS
2007
IEEE
13 years 12 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
PAKDD
2009
ACM
14 years 2 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
ICRA
2009
IEEE
14 years 7 days ago
2009
IEEE
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...