297 search results - page 4 / 60 » Every Sequence Is Decompressible from a Random One |
95
Voted
BMCBI
2005
14 years 10 months ago
2005
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
107
Voted
RSA
2011
14 years 5 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
99
Voted
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper presents a novel scheme for extracting a still background occluded by a number of foreground objects, moving in different directions and velocities in a video sequence,...
MST
2006
14 years 10 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
CIE
2007
Springer
15 years 5 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...