Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Kalpesh Kapoor"'
Publikováno v:
Blockchain: Research and Applications, Vol 5, Iss 2, Pp 100179- (2024)
Payment Channel Networks (PCNs) are a promising alternative to improve the scalability of a blockchain network. A PCN employs off-chain micropayment channels that do not need a global block confirmation procedure, thereby sacrificing the ability to c
Externí odkaz:
https://doaj.org/article/a6c8e016e1cf413bbf20983933849d8e
Autor:
Shibsankar Das, Kalpesh Kapoor
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 1, Pp 1-12 (2017)
We consider the problem of finding a bijection to match a pattern in a text where both the pattern and the text are strings from distinct alphabets. The objective of weighted approximate parameterized string matching problem is to find approximate pa
Externí odkaz:
https://doaj.org/article/5d61bdf0a9854836a83d3aeff2780052
Publikováno v:
Communications of the ACM. 65:40-42
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cebfdd8d1a9257387e17c259c0559843
https://doi.org/10.1145/3564603
https://doi.org/10.1145/3564603
Autor:
Maithilee Patawar, Kalpesh Kapoor
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaf30b362509face92efc38ce5fc3d72
https://doi.org/10.2139/ssrn.4220707
https://doi.org/10.2139/ssrn.4220707
Publikováno v:
COMSNETS
Blockchain technology is finding its application in a wide range of areas. Due to the highly decentralized and distributed nature of blockchain technology, it is essential to understand the behaviour of a system before its actual deployment. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c690596cca01cd026392be9a7678434
https://doi.org/10.1109/comsnets51098.2021.9352838
https://doi.org/10.1109/comsnets51098.2021.9352838
Autor:
Maithilee Patawar, Kalpesh Kapoor
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
A square is a concatenation of two identical words. A long-standing open conjecture is that the number of distinct squares in a word is bounded by its length. When two squares start at a location for the last time in a word, the longer square is call
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afcc3f29e5d2303e495ec4be271aea2f
https://doi.org/10.1007/978-3-030-83823-2_79
https://doi.org/10.1007/978-3-030-83823-2_79
Autor:
Kalpesh Kapoor, Maithilee Patawar
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030678982
CALDAM
CALDAM
The square conjecture claims that the number of distinct squares in a word is at most equal to the length of the word. While the conjecture is still open, there have been attempts to define patterns representing a collection of words with a large num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcaa16e606fa6e65f90b73ec5d35db8c
https://doi.org/10.1007/978-3-030-67899-9_32
https://doi.org/10.1007/978-3-030-67899-9_32
Autor:
Kalpesh Kapoor, Shibsankar Das
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 1, Pp 1-12 (2017)
We consider the problem of finding a bijection to match a pattern in a text where both the pattern and the text are strings from distinct alphabets. The objective of weighted approximate parameterized string matching problem is to find approximate pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a629f3fb38a848e1a2f8c2a6c62d62f5
https://doi.org/10.1016/j.akcej.2016.11.010
https://doi.org/10.1016/j.akcej.2016.11.010
Publikováno v:
IETE Journal of Research. 63:60-70
Hypergraph partitioning is commonly used in solving very large scale integration (VLSI) placement problem, data mining, sparse matrix multiplication, and parallel computing. This paper presents a novel heuristic for hypergraph partitioning based on n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::730d43fd7a88fca40356d7a09379c7e5
https://doi.org/10.1080/03772063.2016.1242381
https://doi.org/10.1080/03772063.2016.1242381
Publikováno v:
Discrete Applied Mathematics. 206:115-121
A word is said to be primitive if it cannot be expressed as non-trivial power of another word. We characterize a class of primitive words, referred as del-robust primitive words, which remain primitive on deletion of any letter. It is also shown that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0cd911441fef8487c7f09c6b0843f84
https://doi.org/10.1016/j.dam.2016.01.031
https://doi.org/10.1016/j.dam.2016.01.031