Sciweavers

508 search results - page 94 / 102
» Quantum Computers
Sort
View
RT
2005
Springer
15 years 3 months ago
Non-linear Volume Photon Mapping
This paper describes a novel extension of the photon mapping algorithm, capable of handling both volume multiple inelastic scattering and curved light paths simultaneously. The ex...
Diego Gutierrez, Adolfo Muñoz, Oscar Anson,...
CIE
2006
Springer
15 years 1 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
ML
2000
ACM
244views Machine Learning» more  ML 2000»
14 years 9 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski
VTS
2003
IEEE
115views Hardware» more  VTS 2003»
15 years 2 months ago
Fault Testing for Reversible Circuits
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
Ketan N. Patel, John P. Hayes, Igor L. Markov
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
14 years 11 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...