An optimal linear time algorithm for quasi-monotonic segmentation

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.86, Iss.7, 2009-07, pp. : 1093-1104

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Linear-time algorithm for the matched-domination problem in cographs

By Hung Ruo-Wei Yao Chih-Chia

International Journal of Computer Mathematics, Vol. 88, Iss. 10, 2011-07 ,pp. : 2042-2056

Taylor & Francis Ltd

Access to resources Recommend Favorite

A linear time algorithm for recognizing regular Boolean functions

By Makino K.

Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. : 155-176

Academic Press

Access to resources Recommend Favorite

A Linear Time Algorithm for Finding a k -Tree Core

By Shioura A. Uno T.

Journal of Algorithms, Vol. 23, Iss. 2, 1997-05 ,pp. : 281-290

Academic Press

Access to resources Recommend Favorite

A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language

By Gore V. Jerrum M. Kannan S. Sweedyk Z. Mahaney S.

Information and Computation, Vol. 134, Iss. 1, 1997-04 ,pp. : 59-74

Academic Press

Access to resources Recommend Favorite

Quasi‐Time‐Dependent $H_{\infty}$ Controller for Discrete‐Time Switched Linear Systems With Mode‐Dependent Average Dwell‐Time

ASIAN JOURNAL OF CONTROL, Vol. 20, Iss. 1, 2018-01 ,pp. : 263-275

John Wiley & Sons Inc

Access to resources Recommend Favorite