Sciweavers

6274 search results - page 363 / 1255
» From query complexity to computational complexity
Sort
View
FOCS
2007
IEEE
16 years 1 months ago
Quantum Algorithms for Hidden Nonlinear Structures
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
Andrew M. Childs, Leonard J. Schulman, Umesh V. Va...
IPPS
2009
IEEE
16 years 1 months ago
High-throughput protein structure determination using grid computing
Determining the X-ray crystallographic structures of proteins using the technique of molecular replacement (MR) can be a time and labor-intensive trial-and-error process, involvin...
Jason W. Schmidberger, Blair Bethwaite, Colin Enti...
ACMMSP
2005
ACM
106views Hardware» more  ACMMSP 2005»
16 years 9 days ago
Impact of modern memory subsystems on cache optimizations for stencil computations
In this work we investigate the impact of evolving memory system features, such as large on-chip caches, automatic prefetch, and the growing distance to main memory on 3D stencil ...
Shoaib Kamil, Parry Husbands, Leonid Oliker, John ...
SC
2005
ACM
16 years 9 days ago
PerfExplorer: A Performance Data Mining Framework For Large-Scale Parallel Computing
Parallel applications running on high-end computer systems manifest a complexity of performance phenomena. Tools to observe parallel performance attempt to capture these phenomena...
Kevin A. Huck, Allen D. Malony
CF
2010
ACM
15 years 12 months ago
Enabling a highly-scalable global address space model for petascale computing
Over the past decade, the trajectory to the petascale has been built on increased complexity and scale of the underlying parallel architectures. Meanwhile, software developers hav...
Vinod Tipparaju, Edoardo Aprà, Weikuan Yu, ...