The fork-join queue models parallel resources where arriving jobs divide into various number of sub-tasks that are assigned to unique devices within the parallel resource. Each device in the parallel resource is modeled by M=M=1 queueing servers. A job completes execution and departs the parallel resource after all its sub-tasks complete execution. This paper analyzes N-server fork-join queues ...

In this paper, we propose an efficient method for incorporating the knowledge of global (worst case of on-die, across die, across wafers, and across wafer lots) and local (worst case on-die) process variations into a systematic framework for identifying delay marginalities in a design during first-silicon validation. With the goal of significantly reducing the number of vectors required for val...

In many machine learning domains (such as scene understanding), several related sub-tasks (such as scene categorization, depth estimation, object detection) operate on the same raw data and provide correlated outputs. Each of these tasks is often notoriously hard, and state-of-the-art classifiers already exist for many subtasks. It is desirable to have an algorithm that can capture such correla...

A discriminative dictionary-based approach to supporting the classification of 3D Optical Coherence Tomography (OCT) retinal images, so as to determine the presence of Age-related Macular Degeneration (AMD), is described. AMD is one of the leading causes of blindness in people aged over 50 years. The proposed approach is founded on the concept of a uniform 3D image decomposition into a set of s...