A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree T that contains all information of a given collection P of phylogenetic trees. If the answer is “yes” we say that P is compatible and T displays P . This decision problem is NP-complete even if all input trees are quartets, that is binary trees with exactly four leaves. In this paper, we prove a ...

AbstractWhat does human pose tell us about a scene? We propose task to answer this question: given as input, hallucinate compatible scene. Subtle cues captured by pose—action semantics, environment affordances, object interactions—provide surprising insight into which scenes are compatible. present large-scale generative adversarial network for pose-conditioned scene generation. significantly s...

Results on common fixed points for pairs of single and multivalued mappings on a complete metric space are examined. Our work establishes a common fixed point theorem for a pair of generalized contraction self-maps and a pair of set-valued mappings.