Sciweavers

171 search results - page 3 / 35
» Compressed Representations of Permutations, and Applications
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Optimal representations in multitree dictionaries with application to compression
We generalize our results of [8, 9] and propose a new framework of multitree dictionaries which include many previously proposed dictionaries as well as many new, very large, tree...
Yan Huang, Ilya Pollak, Minh N. Do, Charles A. Bou...
IMA
2009
Springer
152views Cryptology» more  IMA 2009»
14 years 2 months ago
Double-Exponentiation in Factor-4 Groups and Its Applications
In previous work we showed how to compress certain prime-order subgroups of the cyclotomic subgroups of orders 22m + 1 of the multiplicative groups of F∗ 24m by a factor of 4. We...
Koray Karabina
VLSISP
2008
173views more  VLSISP 2008»
13 years 7 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
COMPGEOM
2001
ACM
13 years 11 months ago
Efficient and small representation of line arrangements with applications
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
David P. Dobkin, Ayellet Tal
ICIP
2007
IEEE
14 years 9 months ago
Analysis of the Decoding-Complexity of Compressed Image-Based Scene Representations
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
Ingo Bauermann, Eckehard G. Steinbach