Sciweavers

35 search results - page 5 / 7
» Pseudorandom Generators, Measure Theory, and Natural Proofs
Sort
View
EACL
2009
ACL Anthology
14 years 7 months ago
Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument S
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
Stephen Wan, Mark Dras, Robert Dale, Cécile...
AI
2006
Springer
14 years 9 months ago
Generating and evaluating evaluative arguments
Evaluative arguments are pervasive in natural human communication. In countless situations people attempt to advise or persuade their interlocutors that something is desirable (vs...
Giuseppe Carenini, Johanna D. Moore
JSYML
2008
72views more  JSYML 2008»
14 years 9 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
79
Voted
IANDC
2006
103views more  IANDC 2006»
14 years 9 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
ECSQARU
1995
Springer
15 years 1 months ago
Model-Based Diagnostics Using Hints
It is often possible to describe the correct functioning of a system by a mathematical model. As long as observations or measurements correspond to the predictions made by the mod...
Jürg Kohlas, Paul-André Monney, Rolf H...