Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Deepak Ajwani"'
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030782290
CPAIOR
CPAIOR
In order to deal with the high development time of exact and approximation algorithms for NP-hard combinatorial optimisation problems and the high running time of exact solvers, deep learning techniques have been used in recent years as an end-to-end
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8a27078d914dc6eaa4aa9e5ccbf38ee
https://doi.org/10.1007/978-3-030-78230-6_26
https://doi.org/10.1007/978-3-030-78230-6_26
Publikováno v:
Information Retrieval Journal. 22:256-284
Automated construction of knowledge hierarchies from huge data corpora is gaining increasing attention in recent years, in order to tackle the infeasibility of manually extracting and semantically linking millions of concepts. As a knowledge hierarch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24e701b9c7bc7aa26cdda6f8a3edb1a4
https://doi.org/10.1007/s10791-018-9345-y
https://doi.org/10.1007/s10791-018-9345-y
Publikováno v:
IEEE BigData
Computation of the single-source shortest path (SSSP) is a fundamental primitive in many network analytics tasks. With the increasing size of networks to be analysed, there is a need for efficient tools to compute shortest paths, especially on the wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a02251f33eae5af0d6453f1b855d7832
https://doi.org/10.1109/bigdata47090.2019.9006237
https://doi.org/10.1109/bigdata47090.2019.9006237
Publikováno v:
Proceedings of the VLDB Endowment. International Conference on Very Large Data Bases
We study ranked enumeration of join-query results according to very general orders defined by selective dioids. Our main contribution is a framework for ranked enumeration over a class of dynamic programming problems that generalizes seemingly differ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b5f139b46cc64d90ed080fbadb7ed27
Publikováno v:
Journal of Parallel and Distributed Computing. 96:12-26
To realize the full potential of a high-performance computing system with a reconfigurable interconnect, there is a need to design algorithms for computing a topology that will allow for a high-throughput load distribution, while simultaneously parti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5b2e57aacaed8be1373d32536fadec8
https://doi.org/10.1016/j.jpdc.2016.04.010
https://doi.org/10.1016/j.jpdc.2016.04.010
Publikováno v:
Studies in Computational Intelligence ISBN: 9783030054106
COMPLEX NETWORKS (1)
COMPLEX NETWORKS (1)
The k-shortest path problem is a generalization of the fundamental shortest path problem, where the goal is to compute k simple paths from a given source to a target node, in non-decreasing order of their weight. With numerous applications modeling v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01592fe5172252c12f437aa08b8fa078
https://doi.org/10.1007/978-3-030-05411-3_3
https://doi.org/10.1007/978-3-030-05411-3_3
Autor:
Alessandra Sala, Deepak Ajwani, Bilyana Taneva, Sourav Dutta, Patrick K. Nicholson, Ghasem Heyrani-Nobari
Publikováno v:
IEEE BigData
With the advent of Big Data paradigm, filtering, retrieval, and linking of unstructured multi-modal data has become a necessity. Assigning topic labels to contents, that accurately capture the meaning and contextual information, is a fundamental prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a3df61fe050df86a5a5824ff966e54d
https://doi.org/10.1109/bigdata.2018.8622647
https://doi.org/10.1109/bigdata.2018.8622647
Publikováno v:
ICPP
We consider the loop less k-shortest path (KSP) problem. Although this problem has been studied in the sequential setting for at least the last two decades, no good parallel implementations are known. In this paper, we provide (i) a first systematic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6d278ca701021a319667c0cd9c74814
https://doi.org/10.1145/3225058.3225075
https://doi.org/10.1145/3225058.3225075
Autor:
Wolfgang Gatterbauer, Patrick K. Nicholson, Deepak Ajwani, Mirek Riedewald, Alessandra Sala, Xiaofeng Yang
Publikováno v:
Proceedings of the ... International World-Wide Web Conference. International WWW Conference
WWW
WWW
Many problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on labeled graphs (also called "heterogeneous information networks" or HINs).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07dff3bba35c8fa1e686be849d051887
https://pubmed.ncbi.nlm.nih.gov/30003197
https://pubmed.ncbi.nlm.nih.gov/30003197