297 search results - page 14 / 60 » Every Sequence Is Decompressible from a Random One |
91
Voted
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
104
Voted
BMCBI
2006
15 years 16 days ago
2006
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
90
Voted
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
Current video coding schemes employ motion compensation to exploit the fact that the signal forms an auto-regressive process along the motion trajectory, and remove temporal redun...
101
Voted
TSD
1999
Springer
15 years 4 months ago
1999
Springer
Automatic lipreading is automatic speech recognition that uses only visual information. The relevant data in a video signal is isolated and features are extracted from it. From a s...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We show a novel approach of automatically generating minutes style extractive summaries for parliamentary speech. Minutes are structured summaries consisting of sequences of busin...