The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
As multimedia becomes an integral part of collaborative systems, we must understand how to design such systems to support users’ rich set of existing interaction skills, rather ...
Background: The computer-assisted detection of small molecules by mass spectrometry in biological samples provides a snapshot of thousands of peptides, protein fragments and prote...
Tim O. F. Conrad, Alexander Leichtle, Andre Hageh&...
Many computations exhibit a trade off between execution time and quality of service. A video encoder, for example, can often encode frames more quickly if it is given the freedom ...
Sasa Misailovic, Stelios Sidiroglou, Henry Hoffman...