Abstract. We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster....
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
In this work we present a method for the estimation of a rank-one pattern living in two heterogeneous spaces, when observed through a mixture in multiple observation sets. Using a ...
Ronald Phlypo, Nisrine Jrad, Bertrand Rivet, Marco...
E-learning environments increasingly serve as important infrastructural features of universities that enable teachers to provide students with different representations of knowled...
Outage probabilities in wireless networks depend on various factors: the node distribution, the MAC scheme, and the models for path loss, fading and transmission success. In prior ...
Riccardo Giacomelli, Radha Krishna Ganti, Martin H...