Sun; M. Shao; J. Chen; K. Wong; and X. Wu (Lossy Compression Data Compression): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n*{2}^n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2010 == Reference == https://ieeexplore.ieee.org/document/5474629/") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(kmn)$? | ||
== Space Complexity == | == Space Complexity == | ||
$O(kmn)$? words | |||
() | (Encoding scheme can be thought of as a factor graph with O(k+mn) nodes and O(kmn) edges) | ||
== Description == | == Description == | ||
LDGM codes + multilevel quantization | |||
== Approximate? == | == Approximate? == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM | |||
== Year == | == Year == | ||
Latest revision as of 08:46, 10 April 2023
Time Complexity
$O(kmn)$?
Space Complexity
$O(kmn)$? words
(Encoding scheme can be thought of as a factor graph with O(k+mn) nodes and O(kmn) edges)
Description
LDGM codes + multilevel quantization
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2010