Decidability of equivalence for deterministic synchronized tree automata

By Salomaa K.  

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 171-192

Elsevier

Access to resources Recommend Favorite

Equivalence of conservative, free, linear program schemas is decidable

By Laurence M.R.   Danicic S.   Harman M.   Hierons R.   Howroyd J.  

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 831-862

Elsevier

Access to resources Recommend Favorite

On the equivalence problem for letter-to-letter top-down tree transducers

By Andre Y.   Bossut F.  

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 207-229

Elsevier

Access to resources Recommend Favorite

On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms

By Shalev-Shwartz Shai  

Machine Learning, Vol. 80, Iss. 2-3, 2010-09 ,pp. : 141-163

Springer Publishing Company

Access to resources Recommend Favorite

Adaptive partitioning schemes for bipartite ranking: How to grow and prune a ranking tree

By Clémençon Stéphan   Depecker Marine   Vayatis Nicolas  

Machine Learning, Vol. 83, Iss. 1, 2011-04 ,pp. : 31-69

Springer Publishing Company

Access to resources Recommend Favorite