2930 search results - page 70 / 586 » The optimal sequence compression |
147
Voted
DAWAK
2005
Springer
15 years 9 months ago
2005
Springer
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
129
Voted
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
126
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
158
Voted
BIBE
2008
IEEE
15 years 10 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
116
Voted
ISQED
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linea...