446 search results - page 22 / 90 » A Combinatorial Theorem for Trees |
154
click to vote
JCSS
2006
15 years 6 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
135
click to vote
RECOMB
2008
Springer
16 years 6 months ago
2008
Springer
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
174
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
184
click to vote
LICS
1997
IEEE
15 years 9 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
129
click to vote
ATAL
2009
Springer
16 years 17 days ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...