Jalali; A. Montanari; and T. Weissman (Lossy Compression Data Compression): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2010 == Reference == https://authors.library.caltech.edu/17983/1/Jalali2010p7459Ieee_T_Inform_Theory.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$? words | |||
() | (Derived: Auxiliary data structures consist of a constant number of O(n)-sized vectors and function definitions) | ||
== Description == | == Description == | ||
Wyner-Ziv DUDE | |||
== Approximate? == | == Approximate? == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM | |||
== Year == | == Year == | ||
Latest revision as of 07:56, 10 April 2023
Time Complexity
$O(n)$
Space Complexity
$O(n)$? words
(Derived: Auxiliary data structures consist of a constant number of O(n)-sized vectors and function definitions)
Description
Wyner-Ziv DUDE
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2010
Reference
https://authors.library.caltech.edu/17983/1/Jalali2010p7459Ieee_T_Inform_Theory.pdf