Sciweavers

2520 search results - page 4 / 504
» The complexity of approximating entropy
Sort
View
ICALP
2004
Springer
14 years 3 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
IEICET
2006
76views more  IEICET 2006»
13 years 9 months ago
Relationship among Complexities of Individual Sequences over Countable Alphabet
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
Shigeaki Kuzuoka, Tomohiko Uyematsu
DASIP
2010
13 years 4 months ago
RVC-CAL dataflow implementations of MPEG AVC/H.264 CABAC decoding
This paper describes the implementation of the MPEG AVC CABAC entropy decoder using the RVC-CAL dataflow programming language. CABAC is the Context based Adaptive Binary Arithmeti...
Endri Bezati, Marco Mattavelli, Mickaël Raule...
AAAI
1998
13 years 11 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
IM
2006
13 years 9 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan