Sciweavers

134 search results - page 11 / 27
» Computationally Grounded Theories of Agency
Sort
View
ACL
2001
13 years 10 months ago
Resolving Ellipsis in Clarification
We offer a computational analysis of the resolution of ellipsis in certain cases of dialogue clarification. We show that this goes beyond standard techniques used in anaphora and ...
Jonathan Ginzburg, Robin Cooper
ICCV
2007
IEEE
14 years 10 months ago
The 3D-3D Registration Problem Revisited
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
Hongdong Li, Richard I. Hartley
DIGRA
2005
Springer
14 years 2 months ago
Towards an Ontological Language for Game Analysis
The Game Ontology Project (GOP) is creating a framework for describing, analyzing and games, by defining a hierarchy of concepts abstracted from an analysis of many specific games...
José Pablo Zagal, Michael Mateas, Clara Fer...
AI
2008
Springer
13 years 7 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
DEDS
2008
108views more  DEDS 2008»
13 years 8 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry