446 search results - page 17 / 90 » A Combinatorial Theorem for Trees |
109
click to vote
RANDOM
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
126
Voted
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
140
click to vote
DM
2011
14 years 8 months ago
2011
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
143
Voted
MIAR
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
LATA
2009
Springer
15 years 8 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...