Sciweavers

399 search results - page 20 / 80
» Generating Referring Expressions with Reference Domain Theor...
Sort
View
ACL
1990
13 years 9 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
BCSHCI
2007
13 years 9 months ago
Figuring configuration: "everyday" users and end-user configuration of pervasive computing environments
The research outlined investigates strategies that nonprogramming or “everyday” users may take in interaction with a Pervasive Computing Environment within relevant domains sp...
Thom Heslop
AAAI
2006
13 years 9 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
ICMI
2004
Springer
116views Biometrics» more  ICMI 2004»
14 years 1 months ago
Towards integrated microplanning of language and iconic gesture for multimodal output
When talking about spatial domains, humans frequently accompany their explanations with iconic gestures to depict what they are referring to. For example, when giving directions, ...
Stefan Kopp, Paul Tepper, Justine Cassell
BMCBI
2010
183views more  BMCBI 2010»
13 years 5 months ago
The complexity of gene expression dynamics revealed by permutation entropy
Background: High complexity is considered a hallmark of living systems. Here we investigate the complexity of temporal gene expression patterns using the concept of Permutation En...
Xiaoliang Sun, Yong Zou, Victoria J. Nikiforova, J...