Sciweavers

1710 search results - page 179 / 342
» High-Level Programs and Program Conditions
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 12 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
ANOR
2005
131views more  ANOR 2005»
13 years 8 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
IFIP
2009
Springer
14 years 2 months ago
Probable Innocence in the Presence of Independent Knowledge
Abstract. We analyse the C anonymity protocol under the novel assumption that the attacker has independent knowledge on behavioural patterns of individual users. Und...
Sardaouna Hamadou, Catuscia Palamidessi, Vladimiro...
TPHOL
2008
IEEE
14 years 2 months ago
Formal Reasoning About Causality Analysis
Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality an...
Jens Brandt, Klaus Schneider
IFIP
2003
Springer
14 years 1 months ago
Soft Output Bit Error Rate Estimation for WCDMA
This paper introduces a method that computes an estimation of the bit error rate (BER) based on the RAKE receiver soft output only. For this method no knowledge is needed about the...
Lodewijk T. Smit, Gerard J. M. Smit, Johann Hurink...