( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules.

, , , и . Discovery Science, том 5255 из Lecture Notes in Computer Science, стр. 197-209. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Laura Ramón Giménez

Julijus Algirdas Ramonas

Lutz Ramonat

Wolfgang Ramonat

Oliver Ramonat

 

Другие публикации лиц с тем же именем

Multi-Agent Relational Reinforcement Learning. Explorations in Multi-State Coordination Tasks, , , и . Learning and Adaptation in Multi-Agent Systems, том 3898 из Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, (2006)Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs, , , , , и . CoRR, (2011)Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time., , , , и . J. Univers. Comput. Sci., 21 (7): 891-911 (2015)Compact Representation of Knowledge Bases in ILP., , и . ILP, том 2583 из Lecture Notes in Computer Science, стр. 254-269. Springer, (2002)Learning directed probabilistic logical models: ordering-search versus structure-search., , , и . Ann. Math. Artif. Intell., 54 (1-3): 99-133 (2008)Searching for Compound Goals Using Relevancy Zones in the Game of Go., и . Computers and Games, том 3846 из Lecture Notes in Computer Science, стр. 113-128. Springer, (2004)Open Problem: Learning Dynamic Network Models from a Static Snapshot., и . COLT, том 23 из JMLR Proceedings, стр. 45.1-45.3. JMLR.org, (2012)An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining., и . ECML/PKDD (1), том 7523 из Lecture Notes in Computer Science, стр. 362-377. Springer, (2012)Learning from networked examples., , и . CoRR, (2014)Top-down induction of clustering trees, , и . CoRR, (2000)