Sciweavers

785 search results - page 22 / 157
» Binary Join Trees
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
A context modeling algorithm and its application in video compression
A new algorithm for context modeling of binary sources with application to video compression is presented. Our proposed method is based on a tree rearrangement and tree selection ...
Marta Mrak, Detlev Marpe, Thomas Wiegand
ICIP
2004
IEEE
15 years 11 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
14 years 9 months ago
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
Luc Devroye
53
Voted
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 3 months ago
Multi-level genetic algorithm (MLGA) for the construction of clock binary tree
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
Guofang Nan, Minqiang Li, Jisong Kou
IPL
2000
95views more  IPL 2000»
14 years 9 months ago
An efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
Jean Marcel Pallo