Committee polyhedral separability: complexity and polynomial approximation (Q890319): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mikhail Yu. Khachay / rank
Normal rank
 
Property / author
 
Property / author: Mikhail Yu. Khachay / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AdaBoost.MH / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10994-015-5505-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W575489580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bagging predictors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using iterated bagging to debias regressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support-vector networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of 3-uniform hypergraph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting a weak learning algorithm by majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive game playing using multiplicative weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for set splitting and satisfiability problems with no mixed clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel methods in machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of the minimum committee problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5754127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the minimum committee problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint elimination method for the committee problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Committees of systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computations and committee constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polyhedral separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of locating linear facilities in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Decision Functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:52, 11 July 2024

scientific article
Language Label Description Also known as
English
Committee polyhedral separability: complexity and polynomial approximation
scientific article

    Statements

    Committee polyhedral separability: complexity and polynomial approximation (English)
    0 references
    10 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polyhedral separability
    0 references
    affine committees
    0 references
    computational complexity
    0 references
    approximability
    0 references
    0 references