MOTIVATION It is an important and difficult task to extract gene network information from high-throughput genomic data. A common approach is to cluster genes using pairwise correlation as a distance metric. However, pairwise correlation is clearly too simplistic to describe the complex relationships among real genes since co-expression relationships are often restricted to a specific set of bio...

One of the practical obstacles of learning to rank from pairwise preference labels is in its (apparent) quadric sample complexity. Some heuristics have been tested for overriding this obstacle. In this workshop we will present new provable method for reducing this sample-complexity, almost reaching the informational lower bound, while suffering only negligible sacrifice of optimality. Our main ...

Given a set V of n elements we wish to linearly order them given pairwise preference labels which may be non-transitive (due to irrationality or arbitrary noise). The goal is to linearly order the elements while disagreeing with as few pairwise preference labels as possible. Our performance is measured by two parameters: The number of disagreements (loss) and the query complexity (number of pai...

This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly σ-filtered Boolean algebras. We show that for every uncountable regular cardinal κ there are 2 pairwise non-isomorphic openly generated Boolean algebras of size κ > א1 provided there is an almost free non-free abelian group of size κ. The openly generated Boolea...

In the constructible universe, we construct a co-analytic maximal family of pairwise eventually different functions from $\mathbb{N}$ to which remains after adding arbitrarily many Sacks reals (by countably supported iteration or product).

Given a set V of n elements we wish to linearly order them using pairwise preference labels which may be non-transitive (due to irrationality or arbitrary noise). The goal is to linearly order the elements while disagreeing with as few pairwise preference labels as possible. Our performance is measured by two parameters: The number of disagreements (loss) and the query complexity (number of pai...

Positive and negative plant-plant interactions are major processes shaping plant communities. They are affected by environmental conditions and evolutionary relationships among the interacting plants. However, the generality of these factors as drivers of pairwise plant interactions and their combined effects remain virtually unknown. We conducted an observational study to assess how environmen...

Pairwise testing has become an indispensable tool in a software tester’s toolbox. The technique has been known for almost twenty years [22] but it is the last five years that we have seen a tremendous increase in its popularity. Information on at least 20 tools that can generate pairwise test cases, have so far been published [1]. Most tools, however, lack practical features necessary for them ...