1068 search results - page 180 / 214 » Extremely randomized trees |
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
PAKDD
2009
ACM
14 years 7 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-...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
This paper addresses the problem of recognizing shadows from monochromatic natural images. Without chromatic information, shadow classification is very challenging because the in...
WEA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...