1248 search results - page 170 / 250 » Decision Tree Grafting |
196
click to vote
GREC
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a method of online sketchy shape recognition that can adapt to different user sketching styles. The adaptation principle is based on incremental active learning...
148
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we present a new probabilistic feature-based approach to multi-hypothesis global localization and pose tracking. Hypotheses are generated using a constraintbased sea...
226
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
150
click to vote
ECML
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
158
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...