419 search results - page 35 / 84 » First Order Paths in Ordered Trees |
ECML
2003
Springer
14 years 3 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...
EUSFLAT
2001
13 years 11 months ago
2001
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
ICML
2004
IEEE
14 years 10 months ago
2004
IEEE
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...