Sciweavers

662 search results - page 121 / 133
» Computing the Temporal Structure of Events in Natural Langua...
Sort
View
105
Voted
AGENTS
2001
Springer
15 years 5 months ago
An auction-based method for decentralized train scheduling
We present a computational study of an auction-based method for decentralized train scheduling. The method is well suited to the natural information and control structure of moder...
David C. Parkes, Lyle H. Ungar
121
Voted
RTA
2001
Springer
15 years 4 months ago
Matching Power
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
ACL
2009
14 years 10 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
RTA
2010
Springer
15 years 4 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 8 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson