83 search results - page 11 / 17 » Lossless Data Compression Using Optimal Tree Machines |
JMLR
2008
13 years 7 months ago
2008
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
JMLR
2008
13 years 7 months ago
2008
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
IJIT
2004
13 years 8 months ago
2004
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
DCC
1996
IEEE
13 years 11 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
JEA
2008
13 years 7 months ago
2008
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...