107 search results - page 6 / 22 » Comparison of two bounds of the quantum correlation set |
STOC
1990
ACM
13 years 11 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
Lighting variation is commonly handled by methods invariant to additive and multiplicative changes in image intensity. It has been demonstrated that comparing images using the dir...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
DATE
2003
IEEE
14 years 23 days ago
2003
IEEE
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
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...