Designing a novel linear‐time graph kernel for semantic link network

Publisher： John Wiley & Sons Inc

E-ISSN： 1532-0634|27|15|4039-4052

ISSN： 1532-0626

Source： CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol.27, Iss.15, 2015-10, pp. : 4039-4052

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

Designing a novel linear‐time graph kernel for semantic link network

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 1532-0626, Iss. 15, 2015-10 ,pp. : 4039-4052

John Wiley & Sons Inc

Access to resources Recommend Favorite

A linear-time algorithm to compute a MAD tree of an interval graph

By Dahlhaus E.   Dankelmann P.   Ravi R.  

Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. : 255-259

Elsevier

Access to resources Recommend Favorite

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations

By Alam M.  

Algorithmica, Vol. 67, Iss. 1, 2013-09 ,pp. : 3-22

Springer Publishing Company

Access to resources Recommend Favorite

Algebra model and experiment for semantic link network

By Zhuge Hai   Sun Yunchuan   Jia Ruixiang   Liu Jie  

International Journal of High Performance Computing and Networking, Vol. 3, Iss. 4, 2005-12 ,pp. : 227-238

Inderscience Publishers

Access to resources Recommend Favorite

Linear-Time Self-Interpretation of the Pure Lambda Calculus

By Mogensen T.Æ.  

LISP and Symbolic Computation, Vol. 13, Iss. 3, 2000-09 ,pp. : 217-237

Springer Publishing Company

Access to resources Recommend Favorite