Sciweavers

45 search results - page 7 / 9
» Randomized Quicksort and the Entropy of the Random Source
Sort
View
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 7 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
ICA
2007
Springer
14 years 1 months ago
ICA in Boolean XOR Mixtures
We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean “Exclusive Or” (XOR) operation. Thus, each mixtur...
Arie Yeredor
FOCS
2008
IEEE
14 years 2 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
ICASSP
2011
IEEE
12 years 11 months ago
Maximum likelihood ICA of quaternion Gaussian vectors
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
ISCC
2009
IEEE
177views Communications» more  ISCC 2009»
14 years 2 months ago
SECLOUD: Source and Destination Seclusion Using Clouds for wireless ad hoc networks
—The privacy of communicating entities in wireless ad hoc networks is extremely important due to the potential of their being identified and subsequently subjected to attacks (e...
Razvi Doomun, Thaier Hayajneh, Prashant Krishnamur...