Sciweavers

2446 search results - page 337 / 490
» Polyadic Concept Analysis
Sort
View
113
Voted
AAAI
1990
15 years 3 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
117
Voted
CSL
2010
Springer
15 years 3 months ago
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries
Abstract. We present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic prot...
David A. Basin, Cas J. F. Cremers
102
Voted
DOCENG
2010
ACM
15 years 3 months ago
Linking data and presentations: from mapping to active transformations
Modern GUI toolkits, and especially RIA ones, propose the concept of binding to dynamically link domain data and their presentations. Bindings are very simple to use for predefine...
Olivier Beaudoux, Arnaud Blouin
150
Voted
ADBIS
2010
Springer
173views Database» more  ADBIS 2010»
15 years 2 months ago
Applying the UFO Ontology to Design an Agent-Oriented Engineering Language
The problem of designing suitable conceptual modeling languages for system engineering is far from being solved. In the past years, some works have proposed the use of foundational...
Renata S. S. Guizzardi, Giancarlo Guizzardi
133
Voted
CCS
2010
ACM
15 years 2 months ago
Accountability: definition and relationship to verifiability
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt