Skip to main navigation Skip to search Skip to main content

Two Improved Range-Efficient Algorithms for F0 Estimation

  • He Sun
  • , Chung Keung Poon

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

We present two new algorithms for range-efficient F0 estimating problem and improve the previously best known result, proposed by Pavan and Tirthapura in [15]. Furthermore, these algorithms presented in our paper also improve the previously best known result for Max-Dominance Norm Problem. © Springer-Verlag Berlin Heidelberg 2007

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation
Subtitle of host publication4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings
EditorsJin-Yi Cai, S. Barry Cooper, Hong Zhu
Place of PublicationBerlin, Heidelberg
PublisherSpringer 
Pages659-669
ISBN (Electronic)978-3-540-72504-6
ISBN (Print)978-3-540-72503-9
DOIs
Publication statusPublished - 2007
Event4th International Conference on Theory and Applications of Models of Computation (TAMC 2007) - Shanghai, China
Duration: 22 May 200725 May 2007

Publication series

NameLecture Notes in Computer Science
Volume4484
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Theory and Applications of Models of Computation (TAMC 2007)
PlaceChina
CityShanghai
Period22/05/0725/05/07

Funding

The work described in this paper was fully supported by a grant from City U (SRG 7001969). Corresponding author. E-mail addresses: [email protected] (H. Sun), [email protected] (C.K. Poon).

Research Keywords

  • HASH FUNCTIONS

Fingerprint

Dive into the research topics of 'Two Improved Range-Efficient Algorithms for F0 Estimation'. Together they form a unique fingerprint.

Cite this