2930 search results - page 136 / 586 » The optimal sequence compression |
122
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
158
click to vote
TCS
2008
15 years 3 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
209
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Life science laboratories today have to rely on procedural techniques to store and manage large sequence datasets. Procedural techniques are cumbersome to use and are often very i...
103
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
144
click to vote
PVLDB
2008
15 years 3 months ago
2008
Brighthouse is a column-oriented data warehouse with an automatically tuned, ultra small overhead metadata layer called Knowledge Grid, that is used as an alternative to classical...