We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Abstract: We propose a new system that is able to handle the entire Personal Dataspace of a user. A Personal Dataspace includes all data pertaining to a user on all his disks and o...
Jens-Peter Dittrich, Lukas Blunschi, Markus Fä...
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Background: Human genetic variations primarily result from single nucleotide polymorphisms (SNPs) that occur approximately every 1000 bases in the overall human population. The no...
Jian Tian, Ningfeng Wu, Xuexia Guo, Jun Guo, Juhua...