297 search results - page 28 / 60 » Every Sequence Is Decompressible from a Random One |
IMC
2003
ACM
15 years 4 months ago
2003
ACM
At the TCP sender side, the arrival of an ack packet always triggers the sender to send data packets, which establishes a correspondency between the arrived ack packet and the sen...
BMCBI
2010
14 years 11 months ago
2010
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
WINE
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
FOCS
1995
IEEE
15 years 2 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
ESORICS
2004
Springer
15 years 4 months ago
2004
Springer
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor dep...