540 search results - page 58 / 108 » A New Compression Method for Compressed Matching |
82
Voted
SIGIR
2002
ACM
14 years 9 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
ACL
2010
14 years 7 months ago
2010
This paper introduces mNCD, a method for automatic evaluation of machine translations. The measure is based on normalized compression distance (NCD), a general information theoret...
CPM
2007
Springer
15 years 4 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...