464 search results - page 36 / 93 » Improved Fixed-Parameter Algorithms for Two Feedback Set Pro... |
DAM
2007
15 years 13 days ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
115
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...
97
Voted
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The unpredictable run-time configurations of dynamic, datadriven application systems require flexible simulation components that can adapt to changes in the number of i...
109
Voted
DCG
2008
15 years 16 days ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
101
click to vote
JCSS
2002
15 years 4 days ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...