Sciweavers

Share
211 search results - page 1 / 43
» A Half-Million Strong at Least
Sort
View
COMPUTER
2006
68views more  COMPUTER 2006»
9 years 9 months ago
A Half-Million Strong at Least
Wayne Wolf
SIAMMAX
2010
145views more  SIAMMAX 2010»
9 years 4 months ago
Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
Zhaosong Lu
FOCS
2008
IEEE
10 years 4 months ago
A Counterexample to Strong Parallel Repetition
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...
Ran Raz
CODCRY
2009
Springer
111views Cryptology» more  CODCRY 2009»
10 years 4 months ago
On the Impossibility of Strong Encryption Over
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
Raphael C.-W. Phan, Serge Vaudenay
STACS
2009
Springer
10 years 4 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
books