266 citations
- Research Institute for Astronomy and Astrophysics of MaraghIR77 papers
- Shahid Beheshti UniversityIR12 papers
- University of WaterlooCA11 papers
- Shahid Bahonar University of KermanIR9 papers
- International Center for Relativistic AstrophysicsIT8 papers
- Yasouj UniversityIR8 papers
- University of MazandaranIR7 papers
- Institute for Research in Fundamental SciencesIR6 papers
- Canadian Quantum Research CenterCA5 papers
- Middle East Technical UniversityTR5 papers
- University of ZanjanIR5 papers
- Isfahan University of TechnologyIR4 papers
18 papers · 1 filter
Competitive Influence Maximization: Integrating Budget Allocation and Seed Selection
Amirhossein Ansari, Masoud Dadgar, Ali Hamzeh +2
Today, many companies take advantage of viral marketing to promote their new products, and since there are several competing companies in many markets, Competitive Influence Maximi…
An Adaptive Similarity Measure to Tune Trust Influence in Memory-Based Collaborative Filtering
Mohammad Reza Zarei, Mohammad R. Moosavi
The aim of the recommender systems is to provide relevant and potentially interesting information to each user. This is fulfilled by utilizing the already recorded tendencies of si…
Noisy Toric code and random bond Ising model: The error threshold in a dual picture
Mohammad Hossein Zarei, Abolfazl Ramezanpour
It is known that noisy topological quantum codes are related to random bond Ising models where the order-disorder phase transition in the classical model is mapped to the error thr…
Impact of the vector dark matter on polarization of the CMB photon
S. Modares Vamegh, M. Haghighat, S. Mahmoudi +1
We consider a vector dark matter (VDM) with a direct coupling with photon. We examine the effect of such an interaction on the CMB polarization to put new constrains on the propert…
On the Total Graph of a Finite Commutative Ring
Mohammad Hadi Shekarriz, Mohammad Hasan Shirdareh Haghighi, Habib Sharif
Let be a finite commutative ring with . In this article, we study the total graph of , denoted by , determine some of its basic graph-theoretical properties, d…
The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs
Aleksandra Gorzkowska, Mohammad Hadi Shekarriz
A graph is said to be -distinguishable if there is a vertex coloring of with a set of colors which breaks all of the automorphisms of but the identity. We call t…