1712 search results - page 147 / 343 » A Computational Approach to Binding Theory |
124
click to vote
SEMCO
2009
IEEE
15 years 8 months ago
2009
IEEE
- Semantic processing represents the new challenge for all applications that require text understanding, as for instance Q/A. In this paper we will highlight the need to couple sta...
123
Voted
ACMACE
2005
ACM
15 years 7 months ago
2005
ACM
Building upon research on motivation theory, we provide insights on how video games can be framed as expert tools that naturally reconcile learning and fun, a worthy goal since st...
137
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
CHI
2006
ACM
16 years 2 months ago
2006
ACM
In this paper we describe the development and initial testing of a tool for self-assessment of affect while interacting with computer systems: the Sensual Evaluation Instrument. W...
103
Voted
BIRTHDAY
2007
Springer
15 years 8 months ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...