301 search results - page 20 / 61 » Probabilistic rough set approximations |
IJAR
2002
13 years 7 months ago
2002
We develop a decision-theoretic method that yields approximate, low cost troubleshooting plans by making more relevant observations and devoting more time to generate a plan. The ...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
NAACL
2007
13 years 9 months ago
2007
Traditional noun phrase coreference resolution systems represent features only of pairs of noun phrases. In this paper, we propose a machine learning method that enables features ...
CJ
1999
13 years 7 months ago
1999
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...