436 search results - page 13 / 88 » Decomposing constraint systems: equivalences and computation... |
PERCOM
2007
ACM
14 years 8 months ago
2007
ACM
Unlinkability, the property that prevents an adversary recognizing whether outputs are from the same user, is an important concept in RFID. There are many proposed schemes that pr...
AISC
1994
Springer
14 years 20 days ago
1994
Springer
This paper investigates some soundness conditions which have to be fulfilled in systems with coercions and generic operators. A result of Reynolds on unrestricted generic operators...
AAAI
2000
13 years 10 months ago
2000
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
DCG
1998
13 years 8 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...