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

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

By Dessmark Anders   Jansson Jesper   Lingas Andrzej   Lundell Eva-Marta  

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 233-248

Springer Publishing Company

Access to resources Recommend Favorite

On polynomial-time approximation algorithms for the variable length scheduling problem

By Czumaj A.   Gasieniec L.   Gaur D.R.   Krishnamurti R.   Rytter W.   Zito M.  

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 489-495

Elsevier

Access to resources Recommend Favorite

Stability of parallel algorithms for polynomial evaluation

By Barrio R.   Yalamov P.  

Computers and Mathematics with Applications, Vol. 46, Iss. 5, 2003-09 ,pp. : 769-781

Elsevier

Access to resources Recommend Favorite

Compressed labeling on distilled labelsets for multi-label learning

By Zhou Tianyi   Tao Dacheng   Wu Xindong  

Machine Learning, Vol. 88, Iss. 1-2, 2012-07 ,pp. : 69-126

Springer Publishing Company

Access to resources Recommend Favorite