Traditionally, application software developers carry out their tests on their own local development databases. However, such local databases usually have only a small number of sa...
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
— Following a toxic contaminant release, either accidental or intentional, predicting the transport and dispersion of the contaminant becomes a critical problem for Homeland Defe...
Sue Ellen Haupt, George S. Young, Christopher T. A...