501 search results - page 56 / 101 » Rough Sets |
PODC
2011
ACM
12 years 11 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
The goal of this paper is to offer a framework for image classification "by type". For example, one may want to classify an image of a certain office as man-made ? as op...
STOC
2003
ACM
14 years 9 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...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
— Trajectory-based methods offer an attractive methodology for automated, on-demand generation of macromodels for custom circuits. These models are generated by sampling the stat...
PAKDD
2009
ACM
14 years 3 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/...