Sciweavers

116 search results - page 8 / 24
» Min-Wise Independent Permutations
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
ICASSP
2008
IEEE
14 years 3 months ago
Maximum a posteriori ICA: Applying prior knowledge to the separation of acoustic sources
Independent component analysis (ICA) for convolutive mixtures is often applied in the frequency domain due to the desirable decoupling into independent instantaneous mixtures per ...
Graham W. Taylor, Michael L. Seltzer, Alex Acero
JCT
2008
103views more  JCT 2008»
13 years 8 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
14 years 8 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
CASC
2007
Springer
133views Mathematics» more  CASC 2007»
14 years 2 months ago
Algebraic Visualization of Relations Using RelView
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
Rudolf Berghammer, Gunther Schmidt