We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
We describe semi-Markov conditional random fields (semi-CRFs), a conditionally trained version of semi-Markov chains. Intuitively, a semiCRF on an input sequence x outputs a "...