Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
Hao Li, Constance L. Wood, Yushu Liu, Thomas V. Ge...
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
Abstract. In this paper, we present novel image-derived, invariant features that accurately capture both the geometric and color properties of an imaged object. These features can ...
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...