Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
This paper considers control of nonstationary linear parameter-varying systems, and is motivated by interest in the control of nonlinear systems along prespecified trajectories. I...
The Workshop on Organizing Workshops, Conferences, and Symposia for Computer Systems (WOWCS) was organized to "bring together conference organizers (past, present, and future...
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...