Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Bapi Chatterjee"'
Publikováno v:
ICDCN
The Nearest neighbour search (NNS) is a fundamental problem in many application domains dealing with multidimensional data. In a concurrent setting, where dynamic modifications are allowed, a linearizable implementation of the NNS is highly desirable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1394ce866fc73646c5b74858c6cdcb14
https://doi.org/10.1016/j.tcs.2021.06.041
https://doi.org/10.1016/j.tcs.2021.06.041
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:9037-9045
One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of sto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9c8e4daba5c25399865a90d618b3e5d
https://doi.org/10.1609/aaai.v35i10.17092
https://doi.org/10.1609/aaai.v35i10.17092
Publikováno v:
AAAI 2021-35th Conference on Artificial Intelligence
AAAI 2021-35th Conference on Artificial Intelligence, Feb 2021, Virtual, United States. pp.1-8
HAL
AAAI 2021-35th Conference on Artificial Intelligence, Feb 2021, Virtual, United States. pp.1-8
HAL
Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88fb961819acf99141c05806868fb874
http://arxiv.org/abs/1905.11845
http://arxiv.org/abs/1905.11845
Publikováno v:
Complex Networks and Their Applications VIII ISBN: 9783030366865
COMPLEX NETWORKS (1)
COMPLEX NETWORKS (1)
Persistent homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape and structure of the neighborhood of individual data items (nod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17f437c9276ccef24fe329c6556b06be
https://doi.org/10.1007/978-3-030-36687-2_3
https://doi.org/10.1007/978-3-030-36687-2_3
Autor:
Kushagra Aggarwal, Praveen Jayachandran, Sameep Mehta, Bapi Chatterjee, Sandeep Hans, Himanshu Gupta
Publikováno v:
ICDE
In this paper, we discuss the problem of efficiently handling temporal queries on Hyperledger Fabric, a popular implementation of Blockchain technology. The temporal nature of the data inserted by the Hyperledger Fabric transactions can be leveraged
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c8afc8754ae1619fd937f42b3b57ef4
https://doi.org/10.1109/icde.2018.00167
https://doi.org/10.1109/icde.2018.00167
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030032319
SSS
SSS
The priority queue with DeleteMin and Insert operations is a classical interface for ordering items associated with priorities. Some important algorithms, such as Dijkstra’s single-source-shortest-path, Adaptive Huffman Trees, etc. also require cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::204e24ac4d6e288098668debffa68a51
https://doi.org/10.1007/978-3-030-03232-6_24
https://doi.org/10.1007/978-3-030-03232-6_24
Publikováno v:
CLOUD
Hadoop as a service (HaaS), also known as Hadoop in the cloud, is a big data analytics framework that stores and analyzes data in the cloud using Hadoop/Spark. In this paper, we discuss the importance of providing provenance capabilities in context o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c063afa02fd324141a5cb079dd9d9a1
https://doi.org/10.1109/cloud.2017.91
https://doi.org/10.1109/cloud.2017.91
Autor:
Bapi Chatterjee
Publikováno v:
ICDCN
Efficient concurrent data structures that support range queries are highly sought-after in a number of application areas. For example, the contemporary big-data processing platforms employ them as in-memory index structures for fast and scalable real
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de75e0a528afd081e9eed17d9e86fa6a
https://doi.org/10.1145/3007748.3007771
https://doi.org/10.1145/3007748.3007771
Publikováno v:
ICPP
Helping is a widely used technique to guarantee lock-freedom in many concurrent data structures. An optimized helping strategy improves the overall performance of a lock-free algorithm. In this paper, we propose help-optimality, which essentially imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb6ab2a4e2c229c3ce7f14191b3a3e5d
https://doi.org/10.1109/icpp.2016.48
https://doi.org/10.1109/icpp.2016.48
Publikováno v:
PODC
In this paper we present a novel algorithm for concurrent lock-free internal binary search trees (BST) and implement a Set abstract data type (ADT) based on that. We show that in the presented lock-free BST algorithm the amortized step complexity of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::340bb25ec68bc4a1d577e40291ab0958
https://doi.org/10.1145/2611462.2611500
https://doi.org/10.1145/2611462.2611500