Sciweavers

558 search results - page 87 / 112
» Conversational Case-Based Reasoning
Sort
View
TLCA
2007
Springer
15 years 8 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
ACII
2005
Springer
15 years 7 months ago
Affective Composites: Autonomy and Proxy in Pedagogical Agent Networks
This paper proposes an alternative paradigm for building affective competencies in embodied conversational agents (ECAs). The key feature of this approach -- and the reason for ref...
Eric R. Hamilton
CHES
2004
Springer
130views Cryptology» more  CHES 2004»
15 years 7 months ago
Switching Blindings with a View Towards IDEA
Cryptographic algorithms implemented on smart-cards must be protected against side-channel attacks. Some encryption schemes and hash functions like IDEA, RC6, MD5, SHA-1 alternate ...
Olaf Neiße, Jürgen Pulkus
FOSSACS
2004
Springer
15 years 7 months ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
128
Voted
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
15 years 6 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley