Sciweavers

1772 search results - page 26 / 355
» Classifying Problems into Complexity Classes
Sort
View
TCS
2008
13 years 7 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
DAWAK
2008
Springer
13 years 9 months ago
Selective Pre-processing of Imbalanced Data for Improving Classification Performance
In this paper we discuss problems of constructing classifiers from imbalanced data. We describe a new approach to selective preprocessing of imbalanced data which combines local ov...
Jerzy Stefanowski, Szymon Wilk
FSS
2008
110views more  FSS 2008»
13 years 7 months ago
Learning valued preference structures for solving classification problems
This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our...
Eyke Hüllermeier, Klaus Brinker
WG
2007
Springer
14 years 1 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
ICDAR
2003
IEEE
14 years 29 days ago
A New Classifier Simulator for Evaluating Parallel Combination Methods
The use of artificial outputs generated by a classifier simulator has recently emerged as a new trend to provide an underlying evaluation of classifier combination methods. In thi...
Héla Zouari, Laurent Heutte, Yves Lecourtie...