Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems (Q1885820): 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.1016/j.dam.2004.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086911752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Grouping for Maximum Homogeneity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank

Latest revision as of 15:12, 7 June 2024

scientific article
Language Label Description Also known as
English
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems
scientific article

    Statements

    Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems (English)
    0 references
    12 November 2004
    0 references
    0 references
    Polynomial approximation
    0 references
    Discrete segmentation
    0 references
    Continuous segmentation
    0 references
    0 references
    0 references