9572 search results - page 297 / 1915 » Cover Algorithms and Their Combination |
176
click to vote
ISIPTA
2005
IEEE
16 years 26 days ago
2005
IEEE
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility ...
180
click to vote
ALT
2006
Springer
15 years 11 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...
175
click to vote
ICFEM
2000
Springer
15 years 11 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 ...
195
click to vote
ACL
1998
15 years 8 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...
188
click to vote
CORR
2010
Springer
15 years 7 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...