1445 search results - page 119 / 289 » Uniformly Hard Languages |
113
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
The rate of occurrence of words is not uniform but varies from document to document. Despite this observation, parameters for conventional n-gram language models are usually deriv...
140
click to vote
IPM
2000
15 years 3 months ago
2000
The Text REtrieval Conference is a workshop series designed to encourage research on text retrieval for realistic applications by providing large test collections, uniform scoring...
135
click to vote
APAL
1998
15 years 3 months ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
136
click to vote
TCS
2002
15 years 3 months ago
2002
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
128
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The social and economic importance of large bodies of programs and data that are potentially long-lived has attracted much attention in the commercial and research communities. Her...