148 search results - page 2 / 30 » On Perfect Completeness for QMA |
ICASSP
2009
IEEE
14 years 16 hour ago
2009
IEEE
Without any assumption on the cover source, this paper presents a complete characterization of all perfectly secure stego-systems that employ mutually independent embedding operat...
EJC
2007
13 years 5 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
APPROX
2009
Springer
13 years 12 months ago
2009
Springer
COCO
2006
Springer
13 years 9 months ago
2006
Springer
JMLR
2012
11 years 7 months ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...