1445 search results - page 41 / 289 » Uniformly Hard Languages |
123
Voted
DM
2006
15 years 3 months ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
126
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...
98
Voted
IPM
2008
15 years 3 months ago
2008
ct 8 In this paper, a new robust relevance model is proposed that can be applied to both pseudo and true relevance feedback 9 in the language-modeling framework for document retrie...
126
Voted
ISCA
1997
IEEE
15 years 7 months ago
1997
IEEE
As processor architectures have increased their reliance on speculative execution to improve performance, the importance of accurate prediction of what to execute speculatively ha...
115
Voted
DBPL
1995
Springer
15 years 7 months ago
1995
Springer
We describe the Tycoon approach to scale the successful notion of a uniform, type-safe persistent object store to communication-intensive applications and applications where lo...