2356 search results - page 157 / 472 » Characterizations of postman sets |
203
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Supervised learning uses a training set of labeled examples to compute a classifier which is a mapping from feature vectors to class labels. The success of a learning algorithm i...
131
click to vote
APAL
2008
15 years 6 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
176
click to vote
TCS
2008
15 years 6 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
165
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
The visual appearance of an image is closely associated with its low-level features. Identifying the set of features that best characterizes the image is useful for tasks such as ...
173
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...