Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Elaheh Sadredini"'
Publikováno v:
2022 IEEE 40th International Conference on Computer Design (ICCD).
Autor:
Jingyao Zhang, Elaheh Sadredini
In the age of big data, information security has become a major issue of debate, especially with the rise of the Internet of Things (IoT), where attackers can effortlessly obtain physical access to edge devices. The hash algorithm is the current foun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83c869fa3091a02bc7b783a73677ccb4
http://arxiv.org/abs/2208.07570
http://arxiv.org/abs/2208.07570
Autor:
Mohsen Imani, Ali Zakeri, Hanning Chen, TaeHyun Kim, Prathyush Poduval, Hyunsei Lee, Yeseong Kim, Elaheh Sadredini, Farhad Imani
Publikováno v:
Proceedings of the 59th ACM/IEEE Design Automation Conference.
Autor:
Zhuowen Zou, Hanning Chen, Prathyush Poduval, Yeseong Kim, Mahdi Imani, Elaheh Sadredini, Rosario Cammarota, Mohsen Imani
Publikováno v:
Proceedings of the 49th Annual International Symposium on Computer Architecture.
Publikováno v:
IEEE Computer Architecture Letters. 19:167-170
The demand for accelerated pattern matching has motivated several recent in-memory accelerator architectures for automata processing, which is an efficient computation model for sophisticated pattern matching. Existing in-memory pattern matching arch
To provide data and code confidentiality and reduce the risk of information leak from memory or memory bus, computing systems are enhanced with encryption and decryption engine. Despite massive efforts in designing hardware enhancements for data and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8937091c04cce599cee547d4a0c8c178
Publikováno v:
DAC
Pattern matching is one of the key algorithms in identifying and analyzing genomic data. In this paper, we propose HYPERS, a novel framework supporting highly efficient and parallel pattern matching based on HyperDimensional computing (HDC). HYPERS t
Publikováno v:
MICRO
Automata processing is an efficient computation model for regular expressions and other forms of sophisticated pattern matching. The demand for high-throughput and real-time pattern matching in many applications, including network intrusion detection
Publikováno v:
IEEE Computer Architecture Letters. 18:87-90
Accelerating finite automata processing benefits regular-expression workloads and a wide range of other applications that do not map obviously to regular expressions, including pattern mining, bioinfomatics, and machine learning. Existing in-memory a
Publikováno v:
FCCM
Regular expressions have been widely used in various application domains such as network security, machine learning, and natural language processing. Increasing demand for accelerated regular expressions, or equivalently finite automata, has motivate