297 search results - page 9 / 60 » Every Sequence Is Decompressible from a Random One |
90
Voted
CIE
2010
Springer
15 years 4 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
120
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
101
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
102
Voted
ICIP
1994
IEEE
16 years 1 months ago
1994
IEEE
Motion information is essential in many computer vision and video analysis tasks. Since MPEG is still one of the most prevalent formats for representing, transferring and storing ...
ALMOB
2008
15 years 18 days ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...