9842 search results - page 444 / 1969 » The Complexity of the Matching-Cut Problem |
211
Voted
AUSDM
2008
Springer
15 years 9 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
220
Voted
CORR
2007
Springer
15 years 7 months ago
2007
Springer
—This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. F...
244
click to vote
TNN
2008
15 years 7 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
220
Voted
PAMI
2007
15 years 7 months ago
2007
We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifier...
218
Voted
PAMI
2007
15 years 7 months ago
2007
—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the orga...