2576 search results - page 63 / 516 » The Complexity of Zero Knowledge |
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—A new 4 × 1 scheme of transmitting two real orthogonal space-time block codes (O-STBC) on the I- and Q-channels with pulse-shaped offset QAM is proposed. This scheme ac...
CPM
1999
Springer
15 years 4 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
COCO
1994
Springer
15 years 4 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
105
click to vote
CORR
2007
Springer
14 years 12 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
107
click to vote
AI
2011
Springer
14 years 7 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...