Sciweavers

491 search results - page 17 / 99
» Random Paintbrush Transformation
Sort
View
RSA
2008
81views more  RSA 2008»
14 years 9 months ago
Analyzing linear mergers
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
Zeev Dvir, Ran Raz
81
Voted
ICIP
2001
IEEE
15 years 11 months ago
Geometric hashing techniques for watermarking
In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techn...
Hagit Zabrodsky Hel-Or, Y. Yitzhaki, Yacov Hel-Or
IPPS
1998
IEEE
15 years 2 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
70
Voted
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
14 years 11 months ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz
113
Voted
IDA
2009
Springer
14 years 7 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis