Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...