114 search results - page 6 / 23 » Compression of a Dictionary |
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
IR
2008
13 years 8 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— This paper considers compression in packet networks. Since data packets may be dropped or arrive reordered, streaming compression algorithms result in a considerable de...
TKDE
2010
13 years 6 months ago
2010
—Long time-series datasets are common in many domains, especially scientific domains. Applications in these fields often require comparing trajectories using similarity measure...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...