Sciweavers

148 search results - page 16 / 30
» On Perfect Completeness for QMA
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
Capacity Region of Gaussian MIMO Broadcast Channels with Common and Confidential Messages
We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common messa...
Ersen Ekrem, Sennur Ulukus
FMSD
2008
64views more  FMSD 2008»
13 years 7 months ago
Robust safety of timed automata
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea...
DAM
2006
116views more  DAM 2006»
13 years 7 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
DAM
2002
135views more  DAM 2002»
13 years 7 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
LOGCOM
2010
154views more  LOGCOM 2010»
13 years 2 months ago
Collaborative Runtime Verification with Tracematches
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
Eric Bodden, Laurie J. Hendren, Patrick Lam, Ondre...