We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Dynamic Information Flow Tracking (DIFT) is a promising security technique. With hardware support, DIFT prevents a wide range of attacks on vulnerable software with minimal perfor...
Current approaches to automated analysis have focused on a small set of prototypic expressions (e.g., joy or anger). Prototypic expressions occur infrequently in everyday life, ho...
Jeffrey F. Cohn, Adena J. Zlochower, James Jenn-Ji...
Manual fingerprint classification proceeds by carefully inspecting the geometric characteristics of major ridge curves in a fingerprint image. We propose an automatic approach of ...
A numerical scheme for bubble trajectories including their collisions is developed. An Eulerian-Lagrangian computational scheme is used to study the bubble trajectories. The 2D ave...