455 search results - page 50 / 91 » On Trees and Noncrossing Partitions |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
We combine multiple description (MD) quantization, entropy coding, and data partitioning to improve the error resiliency of images over varying packet loss channels. Our proposed ...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper describes a low-memory cache efficient Hybrid Block Coder (HBC) for images in which an image subband decomposition is partitioned into a combination of spatial blocks a...