193 search results - page 19 / 39 » Rough Sets in Perception-Based Computing |
120
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
121
click to vote
PAKDD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we propose to study budget semi-supervised learning, i.e., semi-supervised learning with a resource budget, such as a limited memory insufficient to accommodate and/...
132
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
143
click to vote
RSCTC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
132
click to vote
CGF
2010
15 years 3 months ago
2010
This paper presents a diffusion method for generating terrains from a set of parameterized curves that characterize the landform features such as ridge lines, riverbeds or cliffs....