Sciweavers

134 search results - page 22 / 27
» Sign Haar Transform
Sort
View
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 11 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
RECOMB
2007
Springer
14 years 9 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
DAM
2007
120views more  DAM 2007»
13 years 8 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
ICIP
2008
IEEE
14 years 3 months ago
H.264/AVC video scrambling for privacy protection
In this paper, we address the problem of privacy in video surveillance systems. More specifically, we consider the case of H.264/AVC which is the state-of-the-art in video coding....
Frédéric Dufaux, Touradj Ebrahimi
ICCV
2009
IEEE
15 years 23 days ago
Recovering Planar Homographies between 2D Shapes
Images taken from different views of a planar object are related by planar homography. Recovering the parameters of such transformations is a fundamental problem in computer vis...
Jozsef Nemeth, Csaba Domokos, Zoltan Kato