297 search results - page 44 / 60 » Every Sequence Is Decompressible from a Random One |
SAGA
2009
Springer
15 years 5 months ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
125
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
ECCV
2004
Springer
16 years 26 days ago
2004
Springer
In this paper we present an approach for separating two transparent layers in images and video sequences. Given two initial unknown physical mixtures, I1 and I2, of real scene laye...
117
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
In this paper, we derive concentration of measure inequalities for compressive Toeplitz matrices (having fewer rows than columns) with entries drawn from an independent and identic...