297 search results - page 49 / 60 » Every Sequence Is Decompressible from a Random One |
124
click to vote
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...
101
Voted
EOR
2007
15 years 13 days ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
99
Voted
ALGORITHMICA
2002
15 years 10 days ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
113
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
121
Voted
FUN
2010
Springer
15 years 5 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...