It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
Visualizations and simulations in an urban environment need 3D digital maps rather than traditional 2D maps, and constructing 3D maps from multiple data sources has become a promi...
Background: The Affymetrix GeneChip technology uses multiple probes per gene to measure its expression level. Individual probe signals can vary widely, which hampers proper interp...
Rudi Alberts, Peter Terpstra, Menno Hardonk, Leoni...
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...