— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
We present an automated method for the tracking and dynamics modeling of microtubules -a major component of the cytoskeleton- which provides researchers with a previously unattain...
Alphan Altinok, Motaz A. El Saban, Austin J. Peck,...
Abstract. The detection of motion boundaries has been and remains a longstanding challenge in computer vision. In this paper, the recovery of motion boundaries is recast in a broad...
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...