Linear time algorithm for approximating a curve by a single-peaked curve

Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama

研究成果: Chapter

6 被引用数 (Scopus)

抄録

Given a function y = f(x) in one variable, we consider the problem of computing the single-peaked curve y = φ(x) minimizing the L2 distance between them. If the input function f is a histogram with O(n) steps or a piecewise linear function with O(n) linear pieces, we design algorithms for computing φ in linear time. We also give an algorithm to approximate f with a function consisting of the minimum number of single-peaked pieces under the condition that each single-peaked piece is within a fixed L2 distance from the corresponding portion of f.

本文言語English
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編集者Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
出版社Springer Verlag
ページ6-15
ページ数10
ISBN(電子版)9783540206958
DOI
出版ステータスPublished - 2003

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2906
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Linear time algorithm for approximating a curve by a single-peaked curve」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル