715 search results - page 40 / 143 » Second step algorithms in the Burrows-Wheeler compression al... |
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
107
click to vote
STRINGOLOGY
2004
15 years 12 days ago
2004
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
99
Voted
WIOPT
2010
IEEE
14 years 9 months ago
2010
IEEE
—The nodes in wireless sensor networks often collect correlated measurements. Not taking into account this information redundancy is detrimental to the network lifetime, since co...
83
Voted
ICPR
2004
IEEE
16 years 4 days ago
2004
IEEE
The bidirectional texture function (BTF) describes texture appearance variations due to varying illumination and viewing conditions. This function is acquired by large number of m...
IPM
2011
14 years 2 months ago
2011
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...