Sciweavers

1750 search results - page 217 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
COGSCI
2004
105views more  COGSCI 2004»
15 years 6 months ago
Intention, interpretation and the computational structure of language
I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex repr...
Matthew Stone
ESEC
1999
Springer
15 years 10 months ago
FACADE: A Typed Intermediate Language Dedicated to Smart Cards
The use of smart cards to run software modules on demand has become a major business concern for application issuers. Such downloadable executable content requires to be trusted by...
Gilles Grimaud, Jean-Louis Lanet, Jean-Jacques Van...
EXPERT
2008
77views more  EXPERT 2008»
15 years 6 months ago
Is a Semantic Web Agent a Knowledge-Savvy Agent?
nition of a common model that abstracted the shared knowledge (ontology); a formalism for representing such knowledge (Knowledge Interchange Format, or KIF); and a transport-indepe...
Valentina A. M. Tamma, Terry R. Payne
APLAS
2009
ACM
15 years 11 months ago
Parallel Reduction in Resource Lambda-Calculus
We study the resource calculus – the non-lazy version of Boudol’s λ-calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to ...
Michele Pagani, Paolo Tranquilli
AGTIVE
2003
Springer
15 years 11 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman