7123 search results - page 268 / 1425 » The Ordered Set of Rough Sets |
150
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infini...
183
click to vote
JUCS
2010
15 years 5 months ago
2010
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
177
click to vote
WWW
2009
ACM
16 years 1 months ago
2009
ACM
We propose a novel cost-efficient approach to threshold selection for binary web-page classification problems with imbalanced class distributions. In many binary-classification ta...
201
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Phoneme set clustering of accurate modeling is important in the task of multilingual speech recognition, especially when each of the available language training corpora is mismatc...
155
click to vote
ISPASS
2006
IEEE
16 years 20 days ago
2006
IEEE
— Due to the long simulation times of the reference input sets, microarchitects resort to alternative techniques to speed up cycle-accurate simulations. However, the reduction in...