Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
Ryan Johnson, Nikos Hardavellas, Ippokratis Pandis...
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...