297 search results - page 15 / 60 » Every Sequence Is Decompressible from a Random One |
151
click to vote
CC
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
71
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
105
click to vote
BMCBI
2010
15 years 18 days ago
2010
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
100
click to vote
IPM
2011
14 years 3 months ago
2011
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
110
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...