Strongly polynomial efficient approximation scheme for segmentation

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Originalspråkengelska
TidskriftInformation Processing Letters
Volym142
Sidor (från-till)1-8
Antal sidor8
ISSN0020-0190
DOI
StatusPublicerad - feb 2019
Externt publiceradJa
MoE-publikationstypA1 Tidskriftsartikel-refererad

Citera det här

@article{c5ef9e88257b4f168f644ccabbbd8857,
title = "Strongly polynomial efficient approximation scheme for segmentation",
keywords = "Segmentation, Approximation algorithms, Strongly polynomial, Histogram construction, Computational complexity, ALGORITHMS",
author = "Nikolaj Tatti",
year = "2019",
month = "2",
doi = "10.1016/j.ipl.2018.09.007",
language = "English",
volume = "142",
pages = "1--8",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier Scientific Publ. Co",

}

Strongly polynomial efficient approximation scheme for segmentation. / Tatti, Nikolaj.

I: Information Processing Letters, Vol. 142, 02.2019, s. 1-8.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

TY - JOUR

T1 - Strongly polynomial efficient approximation scheme for segmentation

AU - Tatti, Nikolaj

PY - 2019/2

Y1 - 2019/2

KW - Segmentation

KW - Approximation algorithms

KW - Strongly polynomial

KW - Histogram construction

KW - Computational complexity

KW - ALGORITHMS

U2 - 10.1016/j.ipl.2018.09.007

DO - 10.1016/j.ipl.2018.09.007

M3 - Article

VL - 142

SP - 1

EP - 8

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

ER -