341 search results - page 2 / 69 » Paired bondage in trees |
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
IVS
2010
13 years 2 days ago
2010
This article summarises the current state of research into multiple tree visualisations. It discusses the spectrum of current representation techniques used on single trees, pairs ...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
We propose a method for simultaneous detection, localization and segmentation of objects of a known category. We show that this is possible by using segments as features. To this ...
MMSEC
2005
ACM
13 years 10 months ago
2005
ACM
In this work we propose a new algorithm for fragile, high capacity yet file-size preserving watermarking of MPEG-2 streams. Watermarking is done entirely in the compressed domain,...
CADE
2001
Springer
13 years 9 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...