Sciweavers

4708 search results - page 145 / 942
» Generating the Structure of Argument
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 3 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
ACL
2009
15 years 3 months ago
Robust Machine Translation Evaluation with Entailment Features
Existing evaluation metrics for machine translation lack crucial robustness: their correlations with human quality judgments vary considerably across languages and genres. We beli...
Sebastian Padó, Michel Galley, Daniel Juraf...
JAR
2010
122views more  JAR 2010»
14 years 12 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 11 months ago
Reconstruction of Binary Functions and Shapes from Incomplete Frequency Information
The characterization of a binary function by partial frequency information is considered. We show that it is possible to reconstruct the binary signal from incomplete frequency me...
Yu Mao
ACL
2011
14 years 8 months ago
A Bayesian Model for Unsupervised Semantic Parsing
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
Ivan Titov, Alexandre Klementiev