4095 search results - page 268 / 819 » How to test a tree |
MCS
2005
Springer
15 years 6 months ago
2005
Springer
A Half-Against-Half (HAH) multi-class SVM is proposed in this paper. Unlike the commonly used One-Against-All (OVA) and One-Against-One (OVO) implementation methods, HAH is built ...
90
Voted
BIOADIT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
99
Voted
ISRR
2001
Springer
15 years 5 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
105
Voted
KDD
1997
ACM
15 years 4 months ago
1997
ACM
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
92
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...