Sciweavers

73 search results - page 13 / 15
» Some Co-Birkhoff Type Theorems
Sort
View
CONCUR
2012
Springer
11 years 7 months ago
Linearizability with Ownership Transfer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
Alexey Gotsman, Hongseok Yang
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
13 years 11 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
ERSHOV
2009
Springer
13 years 9 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
MLQ
2007
116views more  MLQ 2007»
13 years 4 months ago
Local sentences and Mahlo cardinals
Local sentences were introduced by Ressayre in [Res88] who proved certain remarkable stretching theorems establishing the equivalence between the existence of finite models for t...
Olivier Finkel, Stevo Todorcevic
ICASSP
2011
IEEE
12 years 9 months ago
Using the kernel trick in compressive sensing: Accurate signal recovery from fewer measurements
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
Hanchao Qi, Shannon Hughes