Sciweavers

1743 search results - page 147 / 349
» Generalized Modal Satisfiability
Sort
View
115
Voted
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 3 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
LISP
2008
97views more  LISP 2008»
15 years 3 months ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea
147
Voted
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
15 years 3 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
DICTA
2009
15 years 1 months ago
Multi-projective Parameter Estimation for Sets of Homogeneous Matrices
A number of problems in computer vision require the estimation of a set of matrices, each of which is defined only up to an individual scale factor and represents the parameters of...
Wojciech Chojnacki, Rhys Hill, Anton van den Henge...
117
Voted
CRYPTO
2010
Springer
189views Cryptology» more  CRYPTO 2010»
15 years 25 days ago
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
Eike Kiltz, Adam O'Neill, Adam Smith