Sciweavers

1677 search results - page 20 / 336
» On the Completeness of Quantum Computation Models
Sort
View
ICPR
2008
IEEE
16 years 2 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 1 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 8 months ago
Picturing classical and quantum Bayesian inference
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum...
Bob Coecke, Robert W. Spekkens
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
16 years 1 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
DAC
2004
ACM
16 years 2 months ago
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dy...