Sciweavers

117 search results - page 5 / 24
» On the power of quantum fingerprinting
Sort
View
TCIAIG
2010
13 years 3 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
ITNG
2007
IEEE
14 years 2 months ago
Computational Power of the Quantum Turing Automata
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 2 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
ICIP
2006
IEEE
14 years 10 months ago
Scalable Multimedia Fingerprinting Forensics with Side Information
Digital fingerprinting uniquely labels each distributed copy with user's ID and provides a proactive means to track the distribution of multimedia. Multi-user collusion is a ...
Wan-Yi Sabrina Lin, H. Vicky Zhao, K. J. Ray Liu
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 20 days ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani