1568 search results - page 199 / 314 » The problem of examination questions in algorithmics |
148
click to vote
AAAI
1998
15 years 7 months ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
143
click to vote
MOC
1998
15 years 6 months ago
1998
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
146
click to vote
TALG
2010
15 years 4 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
169
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
177
click to vote
JIIS
2010
15 years 1 months ago
2010
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...