Sciweavers

79 search results - page 4 / 16
» Succinct Ordinal Trees Based on Tree Covering
Sort
View
ICC
2007
IEEE
14 years 1 months ago
Constrained Wavelet Tree Quantization for Image Watermarking
This paper investigates the operations of the wavelet tree based quantization and proposes a constrained wavelet tree quantization for image watermarking. The wavelet coefficients ...
Min-Jen Tsai, Chen-Long Lin
INFOSCALE
2007
ACM
13 years 9 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
TSMC
2002
125views more  TSMC 2002»
13 years 7 months ago
Dynamic page based crossover in linear genetic programming
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
Malcolm I. Heywood, A. Nur Zincir-Heywood
ADC
2003
Springer
115views Database» more  ADC 2003»
13 years 11 months ago
Document Classification via Structure Synopses
Information available in the Internet is frequently supplied simply as plain ascii text, structured according to orthographic and semantic conventions. Traditional document classi...
Liping Ma, John Shepherd, Anh Nguyen
ICIP
2005
IEEE
14 years 9 months ago
Motion-compensation using variable-size block-matching with binary partition trees
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
Marc Servais, Theodore Vlachos, Thomas Davies