Sciweavers

341 search results - page 41 / 69
» Quantum Computation and Lattice Problems
Sort
View
DCC
2011
IEEE
13 years 2 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
ITCC
2005
IEEE
14 years 1 months ago
Computing Molecular Potential Energy Surface with DIET
New developments in the field of theoretical chemistry require the computation of numerous Molecular Potential Energy Surfaces (PESs) to generate adequate quantum force field pa...
Emmanuel Jeannot, Gerald Monard
PRIB
2010
Springer
176views Bioinformatics» more  PRIB 2010»
13 years 5 months ago
An On/Off Lattice Approach to Protein Structure Prediction from Contact Maps
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
Stefano Teso, Cristina Di Risio, Andrea Passerini,...
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
DCC
2006
IEEE
14 years 7 months ago
Optimal Index Assignment for Multiple Description Lattice Vector Quantization
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
Xiang Huang, Xiaolin Wu