Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Avradip Mandal"'
Publikováno v:
PLoS ONE, Vol 16, Iss 12, p e0261250 (2021)
Many fundamental problems in data mining can be reduced to one or more NP-hard combinatorial optimization problems. Recent advances in novel technologies such as quantum and quantum-inspired hardware promise a substantial speedup for solving these pr
Externí odkaz:
https://doaj.org/article/822ccff27d044bc2a5c8e91d172080fd
Publikováno v:
IACR Transactions on Symmetric Cryptology, Pp 427-448 (2017)
Traditionally, modes of Message Authentication Codes(MAC) such as Cipher Block Chaining (CBC) are instantiated using block ciphers or keyed Pseudo Random Permutations(PRP). However, one can also use domain preserving keyed Pseudo Random Functions(PRF
Externí odkaz:
https://doaj.org/article/e7353db9a46649a59421133d2d22147d
Autor:
Junpei Yamaguchi, Toshiya Shimizu, Kazuyoshi Furukawa, Ryuichi Ohori, Takeshi Shimoyama, Avradip Mandal, Hart Montgomery, Arnab Roy, Takuya Ohwa
Publikováno v:
Journal of the Operations Research Society of Japan. 65:121-137
Publikováno v:
ICASSP
Clustering and outlier detection are often studied as separate problems. However, previous work has shown that a unified approach can lead to better performance. Unified clustering and outlier detection is a hard combinatorial problem that has receiv
Publikováno v:
Advances in Intelligent Data Analysis XIX ISBN: 9783030742508
IDA
IDA
Recent advances in specialized hardware for solving optimization problems such quantum computers, quantum annealers, and CMOS annealers give rise to new ways for solving real-word complex problems. However, given current and near-term hardware limita
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43123171c23fe20822c9287341d64f57
https://doi.org/10.1007/978-3-030-74251-5_28
https://doi.org/10.1007/978-3-030-74251-5_28
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030925178
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9dd20f6b089ecfdf41d3811caf8b792
https://doi.org/10.1007/978-3-030-92518-5_25
https://doi.org/10.1007/978-3-030-92518-5_25
Publikováno v:
DCC
CF
CF
Recent hardware advances in quantum and quantum-inspired annealers promise substantial speedup for solving NP-hard combinatorial optimization problems compared to general-purpose computers. These special-purpose hardware are built for solving hard in
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030445836
IDA
IDA
The emergence of specialized optimization hardware such as CMOS annealers and adiabatic quantum computers carries the promise of solving hard combinatorial optimization problems more efficiently in hardware. Recent work has focused on formulating dif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::138aad922001cb7d29c30211776fba4f
https://doi.org/10.1007/978-3-030-44584-3_9
https://doi.org/10.1007/978-3-030-44584-3_9
Autor:
Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Avradip Mandal, Sarvagya Upadhyay, Ilya Safro, Arnab Roy
As we approach the physical limits predicted by Moore's law, a variety of specialized hardware is emerging to tackle specialized tasks in different domains. Within combinatorial optimization, adiabatic quantum computers, CMOS annealers, and optical p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1fb4ff8609922fad7f6045c2b80da75