Shortest consistent superstrings computable in polynomial time

By Jiang T.   Timkovsky V.G.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 113-122

Elsevier

Access to resources Recommend Favorite

Criteria for Polynomial-Time (Conceptual) Clustering

By Pitt L.  

Machine Learning, Vol. 02, Iss. 4, 1988-04 ,pp. : 371-396

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Memory Space Reduction

By Song Yonghong   Wang Cheng   Li Zhiyuan  

International Journal of Parallel Programming, Vol. 33, Iss. 1, 2005-02 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-Time Decomposition Algorithms for Support Vector Machines

By Hush D.  

Machine Learning, Vol. 51, Iss. 1, 2003-04 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite

On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

By Yokomori T.  

Machine Learning, Vol. 19, Iss. 2, 1995-05 ,pp. : 153-179

Springer Publishing Company

Access to resources Recommend Favorite