Sciweavers

915 search results - page 131 / 183
» Proof labeling schemes
Sort
View
DCC
2000
IEEE
13 years 8 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko
LOGCOM
1998
122views more  LOGCOM 1998»
13 years 7 months ago
Adding the Everywhere Operator to Propositional Logic
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
David Gries, Fred B. Schneider
PVLDB
2008
138views more  PVLDB 2008»
13 years 7 months ago
Authenticating the query results of text search engines
The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online search engines. A breached server that is not detected in time...
HweeHwa Pang, Kyriakos Mouratidis
IJCGA
2010
96views more  IJCGA 2010»
13 years 5 months ago
Frameworks Symmetry and Rigidity
Symmetry equations are obtained for the rigidity matrix of a bar-joint framework in Rd . These form the basis for a short proof of the FowlerGuest symmetry group generalisation of...
John C. Owen, Steve C. Power
ADCM
2011
13 years 3 months ago
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
ABSTRACT. In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric pro...
Thorsten Rohwedder, Reinhold Schneider, Andreas Ze...