218 search results - page 3 / 44 » Finite Trees as Ordinals |
EUSFLAT
2001
15 years 3 months ago
2001
We discuss how to aggregate multiple criteria evaluations belonging to qualitative, linearly ordered scales. Qualitative aggregation operations such as min or max can be refined b...
83
Voted
ISCI
2008
15 years 1 months ago
2008
104
Voted
ISMIS
2000
Springer
15 years 5 months ago
2000
Springer
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree inducti...
105
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
99
Voted
IPL
2000
15 years 1 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...