405 search results - page 59 / 81 » Binary Classification Trees for Multi-class Classification P... |
SODA
1998
ACM
14 years 12 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
NIPS
2001
14 years 12 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
DAM
2006
14 years 10 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
ICML
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
CVPR
2007
IEEE
16 years 15 days ago
2007
IEEE
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...