Sharif Digital Repository

A novel design of the KASUMI block cipher using one-hot residue number system

Author

Mahyar, H.

Pub. Year

2012

Subjects

Cryptography. / High-Speed. / KASUMI Block Cipher Computation. / One-Hot. / VLSI Residue Number System (RNS)

Reliable and high-speed KASUMI block cipher by residue number system code

Author

Mahyar, H.

Pub. Year

2012

Subjects

Cryptography. / Error detection and correction. / Fault tolerant systems. / KASUMI block cipher. / Residue number system (RNS) / VLSI.

UCS-NT: An unbiased compressive sensing framework for Network Tomography

Author

Mahyar, H.

Pub. Year

2013

Subjects

Compressive sensing. / Extensive simulations. / Measurement matrix. / Network Monitoring. / Network tomography. / Sparse recovery. / Tomography applications. / Topological constraints. / Computer simulation. / Recovery. / Signal reconstruction. / Computer system recovery.

Detection of top-K central nodes in social networks: A compressive sensing approach

Author

Mahyar, H.

Publisher

Association for Computing Machinery, Inc,

Pub. Year

2015

Subjects

Detection of central nodes. / Social networks. / Top k list of nodes. / Compressed sensing. / Signal reconstruction. / Social networking (online) / Topology. / Central nodes. / Compressive sensing. / Computational costs. / Extensive simulations. / Network centralities. / Network topological structure. / Structural organization. / Palmprint recognition.

Compressed sensing in cyber physical social systems

Author

Grosu, R.

Pub. Year

2018

Subjects

Compressed sensing. / Cyber physical system. / Cyber physical social systems. / Facebook. / Influential nodes. / Network structures. / Prior knowledge. / Randomized gossips. / Social networking (online)

A low-cost sparse recovery framework for weighted networks under compressive sensing

Author

Mahyar, H.

Publisher

Institute of Electrical and Electronics Engineers Inc,

Pub. Year

2015

Subjects

Low-Cost Sparse Recovery. / Social Networks. / Weighted Networks. / Big data. / Compressed sensing. / Computer system recovery. / Costs. / Human computer interaction. / Recovery. / Signal reconstruction. / Social networking (online) / Extensive simulations. / Real-world networks. / Sparse recovery. / Sparse signal recoveries. / State-of-the-art methods. / Topological constraints. / Distributed computer systems.

Extracting implicit social relation for social recommendation techniques in user rating prediction

Author

Taheri, S. M.

Publisher

International World Wide Web Conferences Steering Committee,

Pub. Year

2019

Subjects

Matrix Factorization. / Recommender Systems. / Social Networks. / Social Recommendation Techniques. / Data mining. / Factorization. / Forecasting. / Social networking (online) / World Wide Web. / Hellinger distance. / Implicit trusts. / Matrix factorizations. / Real-world datasets. / Social recommendations. / Social relations. / State of the art. / State-of-the-art approach. / Matrix algebra.

Centrality-based group formation in group recommender systems

Author

Mahyar, H.

Publisher

International World Wide Web Conferences Steering Committee,

Pub. Year

2019

Subjects

Group Recommender Systems. / Social Networks. / Social networking (online) / World Wide Web. / Average numbers. / Centrality. / Centrality measures. / Computational costs. / Group formations. / Network centralities. / Network topological structure. / Recommender systems.

Extracting implicit social relation for social recommendation techniques in user rating prediction

Author

Taheri, S. M.

Publisher

International World Wide Web Conferences Steering Committee,

Pub. Year

2019

Subjects

Matrix Factorization. / Recommender Systems. / Social Networks. / Social Recommendation Techniques. / Data mining. / Factorization. / Forecasting. / Social networking (online) / World Wide Web. / Hellinger distance. / Implicit trusts. / Matrix factorizations. / Real-world datasets. / Social recommendations. / Social relations. / State of the art. / State-of-the-art approach. / Matrix algebra.

Identifying central nodes for information flow in social networks using compressive sensing

Author

Mahyar, H.

Publisher

Springer-Verlag Wien,

Pub. Year

2018

Subjects

Betweenness centrality. / Complex networks. / Compressive sensing. / Social networks. / Top-k nodes. / Complex networks. / Compressed sensing. / Recovery. / Signal reconstruction. / Social networking (online) / Betweenness centrality. / Compressive sensing. / Computationally efficient. / Constructed measurements. / End-to-end measurement. / Sparse signal recoveries. / Top-k nodes. / Topological constraints. / Computer system recovery.

Compressive sensing of high betweenness centrality nodes in networks

Author

Mahyar, H.

Publisher

Elsevier B.V,

Pub. Year

2018

Subjects

Complex network. / Complex networks. / Betweenness centrality. / Biological networks. / Centrality measures. / Compressive sensing. / Extensive simulations. / Global approaches. / Mobile phone networks. / Real-world networks. / Compressed sensing.

CS-ComDet: A compressive sensing approach for inter-community detection in social networks

Author

Mahyar, H.

Publisher

Association for Computing Machinery, Inc,

Pub. Year

2015

Subjects

Compressive sensing. / Inter-community detection. / Social networks. / Population dynamics. / Signal reconstruction. / Social networking (online) / Social sciences. / Community detection. / Community structures. / Compressive sensing. / Network node. / Real-world networks. / Sparse signal recoveries. / Compressed sensing.