29908 search results - page 367 / 5982 » On the Complexity of |
185
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
214
Voted
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
145
click to vote
DLT
2007
15 years 8 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
158
Voted
LREC
2010
15 years 8 months ago
2010
We describe two corpora of question and answer pairs collected for complex, open-domain Question Answering (QA) to enable answer classification and re-ranking experiments. We deli...
177
Voted
EMNLP
2008
15 years 8 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...