Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
There are many watershed transform algorithms in literature but most of them do not exactly correspond to their respective definition. The solution given by such algorithms depend...
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...