Daniel R. Dooly

Learn More
The multiple-instance learning model has received much attention recently with a primary application area being that of drug activity prediction. Most prior work on multiple-instance learning has been for concept learning, yet for drug activity prediction, the label is a real-valued affinity measurement giving the binding strength. We present extensions of(More)
We study an on-line problem that is motivated by the networking problem of dynamically adjusting of acknowledgments in the Transmission Control Protocol (TCP). We provide a theoretical model for this problem in which the goal is to send acks at a time that minimize a linear combination of the cost for the number of acknowledgments sent and the cost for the(More)
WQ study an on-line problem that is motivated by the networking problem of dynamically adjusting delays of acknowlcdgmcnts in the Transmission Control Protocol (TCP). The thcoroticnl problem we study is the following. There is a scqucnco of n packet arrival times .4 = (or,. . . , an) and a look-nhoad coefficient L, The goal is to partition A into 1;(More)
We present smartacking, a technique that improves performance of Transmission Control Protocol (TCP) via adaptive generation of acknowledgments (ACKs) at the receiver. When the bottleneck link is underutilized, the receiver transmits an ACK for each delivered data segment and thereby allows the connection to acquire the available capacity promptly. When the(More)
We consider a network expansion problem for fiber optic networks. Given the network topology, edge costs, and node profit per period, the network is built over T periods due to limited budget available per period. The problem is to find edges to be added at each period so that their edge cost does not exceed the budget limit and the resulting network is(More)
We study an on-line problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgments in the Transmission Control Protocol (TCP). The theoretical problem we study is the following. There is a sequence of n packet arrival times A = and a look-ahead coefficient L. The goal is to partition A into k subsequences sigma1,(More)
  • 1