Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
Paper
HEURISTIC APPROACH FOR FINDING ASYMPTOTICALLY RANDOM GFSR GENERATORS.
Abstract
A heuristic approach for finding asymptotically random GFSR generators is proposed. The basic idea of this approach is the use of random search at the construction of generator matrices for asymptotically random GFSR sequences. By using this approach, five 31-bit asymptotically random GFSR generators with a prime period, 212**7 minus 1, were efficiently found.
Related
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009