1486 search results - page 152 / 298 » Algorithms for two-box covering |
130
click to vote
ALT
2006
Springer
15 years 8 months ago
2006
Springer
A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a par...
123
click to vote
ICFEM
2000
Springer
15 years 8 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
147
Voted
ACL
1998
15 years 5 months ago
1998
I propose a model for determining the hearer's attentional state which depends solely on a list of salient discourse entities (S-list). The ordering among the elements of the...
156
click to vote
ICGI
2010
Springer
15 years 5 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
137
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...