Sciweavers

1677 search results - page 23 / 336
» On the Completeness of Quantum Computation Models
Sort
View
WACV
2002
IEEE
15 years 6 months ago
Pose Estimation and Integration for Complete 3D Model Reconstruction
An automatic 3D model reconstruction technique is presented to acquire complete 3D models of real objects. The technique is based on novel approaches to pose estimation and integr...
Soon-Yong Park, Murali Subbarao
ECCV
2010
Springer
15 years 5 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 1 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
16 years 1 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 1 months ago
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
Pascal O. Vontobel