Sciweavers

1445 search results - page 41 / 289
» Uniformly Hard Languages
Sort
View
DM
2006
83views more  DM 2006»
13 years 10 months ago
Language structure of pattern Sturmian words
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...
Teturo Kamae, Hui Rao, Bo Tan, Yu-Mei Xue
FSTTCS
2004
Springer
14 years 3 months ago
Learning Languages from Positive Data and a Finite Number of Queries
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, ...
Sanjay Jain, Efim B. Kinber
IPM
2008
93views more  IPM 2008»
13 years 10 months ago
A new robust relevance model in the language model framework
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...
Xiaoyan Li
ISCA
1997
IEEE
137views Hardware» more  ISCA 1997»
14 years 2 months ago
A Language for Describing Predictors and Its Application to Automatic Synthesis
As processor architectures have increased their reliance on speculative execution to improve performance, the importance of accurate prediction of what to execute speculatively ha...
Joel S. Emer, Nicholas C. Gloy
DBPL
1995
Springer
124views Database» more  DBPL 1995»
14 years 1 months ago
Scaling Database Languages to Higher-Order Distributed Programming
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...
Bernd Mathiske, Florian Matthes, Joachim W. Schmid...