Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Roy, Indradyumna"'
Publikováno v:
Advances in Neural Information Processing Systems, 38 (2024)
Graph Edit Distance (GED) measures the (dis-)similarity between two given graphs, in terms of the minimum-cost edit sequence that transforms one graph to the other. However, the exact computation of GED is NP-Hard, which has recently motivated the de
Externí odkaz:
http://arxiv.org/abs/2409.17687
Publikováno v:
NeurIPS 2022
The graph retrieval problem is to search in a large corpus of graphs for ones that are most similar to a query graph. A common consideration for scoring similarity is the maximum common subgraph (MCS) between the query and corpus graphs, usually coun
Externí odkaz:
http://arxiv.org/abs/2210.11020
After observing a snapshot of a social network, a link prediction (LP) algorithm identifies node pairs between which new edges will likely materialize in future. Most LP algorithms estimate a score for currently non-neighboring node pairs, and rank t
Externí odkaz:
http://arxiv.org/abs/2012.08974
Autor:
De, Soham, Roy, Indradyumna, Prabhakar, Tarunima, Suneja, Kriti, Chaudhuri, Sourish, Singh, Rita, Raj, Bhiksha
Publikováno v:
INTERSPEECH-2012, 1744-1747 (2012)
Given the large number of new musical tracks released each year, automated approaches to plagiarism detection are essential to help us track potential violations of copyright. Most current approaches to plagiarism detection are based on musical simil
Externí odkaz:
http://arxiv.org/abs/1503.00022