Sciweavers

1054 search results - page 125 / 211
» A Formalization of the Turing Test
Sort
View
ESORICS
2007
Springer
16 years 15 days ago
On the Automated Correction of Security Protocols Susceptible to a Replay Attack
Although there exist informal design guidelines and formal development support, security protocol development is time-consuming because design is error-prone. In this paper, we int...
Juan Carlos López Pimentel, Raul Monroy, Di...
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
16 years 14 days ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
CVPR
2006
IEEE
16 years 12 days ago
Recognition of Composite Human Activities through Context-Free Grammar Based Representation
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to ...
Michael S. Ryoo, J. K. Aggarwal
KCAP
2005
ACM
15 years 12 months ago
Relaxed Precision and Recall for Ontology Matching
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
Marc Ehrig, Jérôme Euzenat
AIED
2005
Springer
15 years 12 months ago
Cross-Cultural Evaluation of Politeness in Tactics for Pedagogical Agents
Politeness may play a role in tutorial interaction, including promoting learner motivation and avoiding negative affect. Politeness theory can account for this as a means of mitiga...
W. Lewis Johnson, Richard E. Mayer, Elisabeth Andr...