Learn More
In this paper, we describe our algorithmic approach to constructing ordered restriction maps based on the data created from the images of population of individual DNA molecules (clones) digested by restriction enzymes. The goal is to devise map-making algorithms capable of producing high-resolution, high-accuracy maps rapidly and in a scalable manner. The(More)
With respect to on-line scheduling algorithms that must direct the service o f s p oradic task requests we quantify the beneet of clairvoyancy, i.e. the power of possessing knowledge of various task parameters of future events. Speciically, we consider the problem of preemp-tively scheduling sporadic task requests in both uni-and multi-processor(More)
Understanding how the structure of a network evolves over time is one of the most interesting and complex topics in the field of social networks. In our attempt to model the dynamics of such systems, we explore an agent-based approach to model growth of email-based social networks, in which individuals establish, maintain and allow atrophy of links through(More)
Verifying the correctness of sequential circuits has been an important problem for a long time. But lack of any formal and efficient method of verification has prevented the creation of practical design aids for this purpose. Since-all the known techniques of simulation apd prototype testing are time consuming and not very reliable, there is an acute need(More)
We prove the following quantitative form of a classical theorem of Steinitz: Let m be sufficiently large. If the convex huh of a subset S of Euclidean d-space contains a unit bMl then there is a subset of S with at most m points whose convex huh contains a ball with the same center and having residual radius 1-3d The case m = 2d was first considered by(More)