The competition-independence game, as introduced by Phillips and Slater, is played on a graph two players, Diminisher Sweller, who are taking turns in choosing vertex that not the closed neighborhood of any previously chosen vertices. goal to minimize (maximal independent) set vertices at end while Sweller wants just opposite. Assuming both players playing optimally according their goals, invar...

Abstract In a breakthrough paper, Benjamini and Hochberg (J Roy Stat Soc Ser B 57:289–300, 1995) proposed a new error measure for multiple testing, the FDR; and developed a distribution-free procedure to control it under independence among the test statistics. In this paper we argue by extensive simulation and theoretical considerations that the assumption of independence is not needed. Along t...

The CKY algorithm is an important component in many natural language parsers. We propose a novel type of constraint for context-free parsing called independence constraints. Based on the concept of independence between words, we show how these constraints can be used to reduce the work done in the CKY algorithm. We demonstrate a classifier which can be used to identify boundaries between indepe...