2957 search results - page 362 / 592 » The Complexity of Polynomial-Time Approximation |
169
click to vote
WAE
1998
15 years 8 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
146
click to vote
JAIR
2008
15 years 6 months ago
2008
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
204
click to vote
TNN
2008
15 years 6 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) ...
187
click to vote
MOC
2002
15 years 6 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
194
click to vote
PAMI
2007
15 years 6 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...