1237 search results - page 79 / 248 » Abstract shade trees |
143
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
137
click to vote
ECML
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
128
click to vote
FORTE
2008
15 years 6 months ago
2008
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...
152
click to vote
CPC
2007
15 years 4 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
162
click to vote
PAMI
2007
15 years 4 months ago
2007
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...