Sciweavers

17 search results - page 3 / 4
» nc 2011
Sort
View
IACR
2011
115views more  IACR 2011»
12 years 4 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen
NC
2011
232views Neural Networks» more  NC 2011»
12 years 11 months ago
The effect of malformed tiles on tile assemblies within the kinetic tile assembly model
Many different constructions of proofreading tile sets have been proposed in the literature to reduce the effect of deviations from ideal behaviour of the dynamics of the molecular...
Ya Meng, Navin Kashyap
CORR
2011
Springer
193views Education» more  CORR 2011»
12 years 12 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
ECCC
2011
205views ECommerce» more  ECCC 2011»
12 years 11 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
ICASSP
2011
IEEE
12 years 8 months ago
Iterative estimation of structures of multiple RNA homologs: Turbofold
TurboFold, an iterative algorithm for estimating the common secondary structures of multiple RNA homologs, is presented. The algorithm is motivated by and has structure and attrib...
Gaurav Sharma, Arif Ozgun Harmanci, David H. Mathe...