Sciweavers

1391 search results - page 38 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ICCS
2005
Springer
14 years 1 months ago
Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations
Abstract. Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the Coupled Cluster method. Transformations using algeb...
Albert Hartono, Alexander Sibiryakov, Marcel Nooij...
COMPUTING
2006
119views more  COMPUTING 2006»
13 years 7 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
ASAP
2008
IEEE
82views Hardware» more  ASAP 2008»
14 years 2 months ago
Run-time thread sorting to expose data-level parallelism
We address the problem of data parallel processing for computational quantum chemistry (CQC). CQC is a computationally demanding tool to study the electronic structure of molecule...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
Statistical and Computational Tradeoffs in Stochastic Composite Likelihood
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
Joshua Dillon, Guy Lebanon
JETAI
2007
131views more  JETAI 2007»
13 years 7 months ago
A computational architecture for heterogeneous reasoning
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
Dave Barker-Plummer, John Etchemendy