Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Sitharama S. Iyengar"'
Publikováno v:
Journal of Sensor and Actuator Networks, Vol 8, Iss 1, p 17 (2019)
Information fusion has been a topic of immense interest owing to its applicability in various applications. This brings to the fore the need for a flexible and accurate fusion algorithm that can be versatile. The Brooks–Iyengar algorithm is one suc
Externí odkaz:
https://doaj.org/article/bc20ee2fa8e94100a85ddcad8f68b135
This book explains the evolution of techniques and strategies in quantum computing, discussing the digital transition towards the quantum computing application in various sectors. The book provides a comprehensive insight into the quantum mechanics a
This book constitutes revised and selected papers from the Sixteenth International Conference on Information Processing, ICInPro 2021, held in Bangaluru, India in October 2021. The 33 full and 9 short papers presented in this volume were carefully
This book provides a Mathematical Theory of Distributed Sensor Networks. It introduces the Mathematical & Computational Structure by discussing what they are, their applications and how they differ from traditional systems. It also explains how mathe
Publikováno v:
Mathematical Theories of Distributed Sensor Networks ISBN: 9781441984197
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43023d36fc7786d5d0589d028e42db9e
https://doi.org/10.1007/978-1-4419-8420-3_5
https://doi.org/10.1007/978-1-4419-8420-3_5
Publikováno v:
Information Processing Letters. 32:183-186
The sequential depth-first-search algorithm, distributed over processor nodes of a graph, yields a distributed depth-first-search algorithm that uses exactly 2| V | messages and 2| V | units of time.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a508f16a9e8e2a58e24e46ce7bf86e4
https://doi.org/10.1016/0020-0190(89)90041-0
https://doi.org/10.1016/0020-0190(89)90041-0
Publikováno v:
Theoretical Computer Science. (2):261-278
In this paper, we consider the problem of recognizing whether a given network is a rectangular mesh. We present an efficient distributed algorithm with an O(N) message and time complexity, where N is the number of nodes in the network. This is an imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72b352c92a0a1eed7352d42d75f375ab
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.