Constant time approximation scheme for largest well predicted subset (Q2377379): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-010-9371-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027636550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closest string and substring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Largest Well-Predicted Subset of Protein Structure Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank

Latest revision as of 15:00, 6 July 2024

scientific article
Language Label Description Also known as
English
Constant time approximation scheme for largest well predicted subset
scientific article

    Statements

    Constant time approximation scheme for largest well predicted subset (English)
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    0 references
    randomization
    0 references
    approximation scheme
    0 references
    constant time
    0 references
    0 references