Sciweavers

1136 search results - page 166 / 228
» Finding Small Holes
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 29 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
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...
Gene Myers
ASPLOS
1994
ACM
14 years 25 days ago
Compiler Optimizations for Improving Data Locality
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...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
MM
1993
ACM
107views Multimedia» more  MM 1993»
14 years 25 days ago
What Video Can and Can't Do for Collaboration: A Case Study
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 ...
Ellen Isaacs, John C. Tang
COMPLIFE
2006
Springer
14 years 14 days ago
Beating the Noise: New Statistical Methods for Detecting Signals in MALDI-TOF Spectra Below Noise Level
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&...
ICSE
2010
IEEE-ACM
13 years 10 months ago
Quality of service profiling
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...