455 search results - page 56 / 91 » On Trees and Noncrossing Partitions |
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents an error-resilient coding technique combined with error concealment for embedded wavelet coders. The coded images are partitioned into packets and protected by...
WG
2004
Springer
14 years 1 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
DCC
1999
IEEE
14 years 5 days ago
1999
IEEE
The set partitioning in hierarchical trees (SPIHT) wavelet image coding algorithm can be interpreted as implicitly using classification in its bit-plane coding procedure. The sourc...
COMPGEOM
1993
ACM
13 years 12 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...