Publication

Found 5 results
Filters: Author is Shervin Daneshpajouh  [Clear All Filters]
2015
Weak visibility counting in simple polygons, Bygi, Mojtaba Nouri, Daneshpajouh Shervin, Alipour Sharareh, and Ghodsi Mohammad , J. Computational Applied Mathematics, Volume 288, p.215–222, (2015)
2012
Computing polygonal path simplification under area measures, Daneshpajouh, Shervin, Ghodsi Mohammad, and Zarei Alireza , Graphical Models, Volume 74, Number 5, p.283–289, (2012)
2011
A Heuristic Homotopic Path Simplification Algorithm, Daneshpajouh, Shervin, and Ghodsi Mohammad , Computational Science and Its Applications - {ICCSA} 2011 - International Conference, Santander, Spain, June 20-23, 2011. Proceedings, Part {III}, p.132–140, (2011)
2008
A Fast Community Based Algorithm for Generating Web Crawler Seeds Set, Daneshpajouh, Shervin, Nasiri Mojtaba Mohammadi, and Ghodsi Mohammad , {WEBIST} 2008, Proceedings of the Fourth International Conference on Web Information Systems and Technologies, Volume 2, Funchal, Madeira, Portugal, May 4-7, 2008, p.98–105, (2008)
 

Join our Google Group Now!



GET IN TOUCH WITH US

Contact us

Sharif University of Technology, Department of Computer Engineering

Room 712, CE Algorithms Lab
P.O. Box 11155-9517, Tehran, Iran

Tel: +9821-6616-6675

Education - This is a contributing Drupal Theme
Design by WeebPal.