Mohammad Naghibi

Learn More
In this paper, we tackle the problem of measuring similarity among graphs that represent real objects with noisy data. To account for noise, we relax the definition of similarity using the maximum weighted co-k-plex relaxation method, which allows dissimilarities among graphs up to a predetermined level. We then formulate the problem as a novel quadratic(More)
—Recently beamforming WiFi access points (APs) have been commercially available from multiple vendors. The promise of beamforming APs is the enhanced range and data transmission rate, albeit at a premium price for the AP which can be an order of magnitude more expensive than regular omnidirectional APs. In this work, through live measurements, we study the(More)
Dimension reduction techniques for text documents can be used for in the preprocessing phrase of blog mining, but these techniques can be more effective if they deal with the nature of the blogs properly. In this paper we propose a novel algorithm called PostRank using shallow approach to identify theme of the blog or blog representative words in order to(More)
  • 1