297 search results - page 12 / 60 » Every Sequence Is Decompressible from a Random One |
91
Voted
TAPSOFT
1995
Springer
15 years 2 months ago
1995
Springer
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor ...
93
Voted
COLT
1992
Springer
15 years 3 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
101
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
BMCBI
2007
14 years 11 months ago
2007
Background: There exist many segmentation techniques for genomic sequences, and the segmentations can also be based on many different biological features. We show how to evaluate ...
107
Voted
IM
2008
14 years 11 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...