Sciweavers

508 search results - page 95 / 102
» Quantum Computers
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
SIBGRAPI
2003
IEEE
15 years 2 months ago
Helical CT Reconstruction from Wide Cone-Beam Angle Data Using ART
We report on new results on the use of Algebraic Reconstruction Techniques (ART) for reconstructing from helical cone-beam Computerized Tomography (CT) data. We investigate two va...
Bruno M. Carvalho, Gabor T. Herman
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 9 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
JSSPP
2010
Springer
14 years 7 months ago
Proposal and Evaluation of APIs for Utilizing Inter-Core Time Aggregation Scheduler
This paper proposes and evaluates APIs for Inter-Core Time Aggregation Scheduler (IAS), which is a kernel-level thread scheduler to enhance performances of multi-threaded programs ...
Satoshi Yamada, Shigeru Kusakabe
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 5 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar