10608 search results - page 678 / 2122 » Complexity of O'Hara's Algorithm |
191
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
218
Voted
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
195
Voted
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
183
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper we propose an algorithm for image recovery where completely lost blocks in an image/video-frame are recovered using spatial information surrounding these blocks. Our...
160
Voted
ICCD
2008
IEEE
16 years 4 months ago
2008
IEEE
— Circuit and processor designs will continue to increase in complexity for the foreseeable future. With these increasing sizes comes the use of wide buses to move large amounts ...