Sciweavers

1995 search results - page 8 / 399
» What's the Problem
Sort
View
ICGI
2010
Springer
13 years 6 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
ACL
2009
13 years 5 months ago
Who, What, When, Where, Why? Comparing Multiple Approaches to the Cross-Lingual 5W Task
Cross-lingual tasks are especially difficult due to the compounding effect of errors in language processing and errors in machine translation (MT). In this paper, we present an er...
Kristen Parton, Kathleen McKeown, Bob Coyne, Mona ...
ICML
2007
IEEE
14 years 8 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
AIPS
2008
13 years 9 months ago
What Makes Planners Predictable?
In recent work we showed that models constructed from planner performance data over a large suite of benchmark problems are surprisingly accurate; 91-99% accuracy for success and ...
Mark Roberts, Adele E. Howe, Brandon Wilson, Marie...
ESEM
2008
ACM
13 years 9 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan