1897 search results - page 118 / 380 » Sparse Additive Machine |
EMNLP
2007
15 years 2 months ago
2007
We present an extension of phrase-based statistical machine translation models that enables the straight-forward integration of additional annotation at the word-level — may it ...
133
Voted
MLQ
2011
14 years 3 months ago
2011
We develop a new method for coding sets while preserving gch in the presence of large cardinals, particularly supercompact cardinals. We will use the number of normal measures carr...
122
Voted
TCC
2005
Springer
15 years 6 months ago
2005
Springer
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
MFCS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
99
Voted
BSL
2008
15 years 26 days ago
2008
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...