Sciweavers

2930 search results - page 114 / 586
» The optimal sequence compression
Sort
View
CGO
2005
IEEE
15 years 3 months ago
Automatic Generation of High-Performance Trace Compressors
Program execution traces are frequently used in industry and academia. Yet, most trace-compression algorithms have to be re-implemented every time the trace format is changed, whi...
Martin Burtscher, Nana B. Sam
ICDE
2007
IEEE
110views Database» more  ICDE 2007»
15 years 11 months ago
Semantic Prefetching of Correlated Query Sequences
We present a system that optimizes sequences of related client requests by combining small requests into larger ones, thus reducing per-request overhead. The system predicts upcom...
Ivan T. Bowman, Kenneth Salem
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 3 months ago
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
Thang Nguyen Bui, Waleed A. Youssef
BIOCOMP
2006
14 years 11 months ago
Parameterized Computation of LCS for Two Sequences
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
Yuan Lin, Jeff Jenness, Xiuzhen Huang
EMNLP
2007
14 years 11 months ago
Compressing Trigram Language Models With Golomb Coding
Trigram language models are compressed using a Golomb coding method inspired by the original Unix spell program. Compression methods trade off space, time and accuracy (loss). The...
Kenneth Church, Ted Hart, Jianfeng Gao