If P is an upper semilattice whose Hasse diagram is a tree and whose cartesian powers are Macaulay, it is shown that Hasse diagram of P is actually a spider in which all the legs ...
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA includes a collecti...
Albert Bifet, Geoff Holmes, Richard Kirkby, Bernha...
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...