Sciweavers

436 search results - page 2 / 88
» Decomposing constraint systems: equivalences and computation...
Sort
View
120
Voted
CADE
2010
Springer
15 years 2 months ago
Automating Security Analysis: Symbolic Equivalence of Constraint Systems
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
134
Voted
HASE
1997
IEEE
15 years 5 months ago
Automated Computation of Decomposable Synchronization Conditions
: The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchroniz...
Gilberto Matos, James M. Purtilo, Elizabeth L. Whi...
117
Voted
ICCV
2003
IEEE
16 years 3 months ago
Scene Modeling Based on Constraint System Decomposition Techniques
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...
Marta Wilczkowiak, Gilles Trombettoni, Christophe ...
104
Voted
AI
2007
Springer
15 years 1 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
86
Voted
EMNLP
2008
15 years 2 months ago
Decomposability of Translation Metrics for Improved Evaluation and Efficient Algorithms
BLEU is the de facto standard for evaluation and development of statistical machine translation systems. We describe three real-world situations involving comparisons between diff...
David Chiang, Steve DeNeefe, Yee Seng Chan, Hwee T...