Sciweavers

144 search results - page 23 / 29
» Introduction to the Special Issue on Natural Language Genera...
Sort
View
CASES
2008
ACM
13 years 10 months ago
Efficient vectorization of SIMD programs with non-aligned and irregular data access hardware
Automatic vectorization of programs for partitioned-ALU SIMD (Single Instruction Multiple Data) processors has been difficult because of not only data dependency issues but also n...
Hoseok Chang, Wonyong Sung
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
LOGCOM
2008
104views more  LOGCOM 2008»
13 years 8 months ago
Testing the Reasoning for Question Answering Validation
Question Answering (QA) is a task that deserves more collaboration between Natural Language Processing (NLP) and Knowledge Representation (KR) communities, not only to introduce r...
Anselmo Peñas, Álvaro Rodrigo, Valen...
SI3D
2006
ACM
14 years 2 months ago
Abstract shade trees
Shade Trees Morgan McGuire George Stathis Hanspeter Pfister Shriram Krishnamurthi Brown University Harvard Extension School MERL Brown University As GPU-powered special effects be...
Morgan McGuire, George Stathis, Hanspeter Pfister,...
COLING
1996
13 years 9 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an