87 search results - page 10 / 18 » Roughness bounds in rough set operations |
74
Voted
FUIN
2007
14 years 9 months ago
2007
Abstract. The paper starts from the standard relational view linking objects and properties in formal concept analysis, here augmented with four modal-style operators (known as suf...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
ALGORITHMICA
2008
14 years 9 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...