Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Rada Chirkova

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Cleber C. Melo-Filho

> Home > Persons > Rada Chirkova

Publications

2022
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/sigmod/HouKMWTC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmod/HouKMWTC22
Pei-Yu Hou, Daniel Robert Korn, Cleber C. Melo-Filho, David R. Wright, Alexander Tropsha, Rada Chirkova:
Compact Walks: Taming Knowledge-Graph Embeddings with Domain- and Task-Specific Pathways. SIGMOD Conference 2022: 458-469
2021
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/bigdataconf/SchatzMTC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bigdataconf/SchatzMTC21
Kara Schatz, Cleber C. Melo-Filho, Alexander Tropsha, Rada Chirkova:
Explaining Drug-Discovery Hypotheses Using Knowledge-Graph Patterns. IEEE BigData 2021: 3709-3716
2020
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2011-07959
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2011-07959
Rahul Yedida, Saad Mohammad Abrar, Cleber C. Melo-Filho, Eugene N. Muratov, Rada Chirkova, Alexander Tropsha:
Text Mining to Identify and Extract Novel Disease Treatments From Unstructured Datasets. CoRR abs/2011.07959 (2020)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.