297 search results - page 54 / 60 » Every Sequence Is Decompressible from a Random One |
128
Voted
DAGSTUHL
2007
15 years 1 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
94
Voted
BMCBI
2007
15 years 17 days ago
2007
Background: In a previous study, we demonstrated that some essential proteins from pathogenic organisms contained sizable insertions/deletions (indels) when aligned to human prote...
112
click to vote
BMCBI
2008
15 years 17 days ago
2008
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
110
Voted
FOCS
2008
IEEE
15 years 1 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the sourc...