Sciweavers

500 search results - page 10 / 100
» Quantum computing: beyond the limits of conventional computa...
Sort
View
VIS
2009
IEEE
430views Visualization» more  VIS 2009»
14 years 5 months ago
Interactive Volume Rendering of Functional Representations in Quantum Chemistry
Simulation and computation in chemistry studies have been improved as computational power has increased over decades. Many types of chemistry simulation results are available, from...
Yun Jang and Ugo Varetto
JSAT
2010
158views more  JSAT 2010»
13 years 2 months ago
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
Olga Tveretina, Carsten Sinz, Hans Zantema
EDBT
2012
ACM
395views Database» more  EDBT 2012»
11 years 10 months ago
Data management with SAPs in-memory computing engine
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
Joos-Hendrik Boese, Cafer Tosun, Christian Mathis,...
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 7 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
EURONGI
2005
Springer
14 years 1 months ago
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Maria José Doménech-Benlloch, Jos&ea...