3020 search results - page 179 / 604 » Optimal partition trees |
177
click to vote
ICIP
2001
IEEE
16 years 8 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...
181
click to vote
ICIP
2000
IEEE
16 years 8 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 ...
165
click to vote
ICIP
2000
IEEE
16 years 8 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...
191
click to vote
CG
2006
Springer
15 years 10 months ago
2006
Springer
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
155
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...