Article Fingerprint
ReserarchID
CSTIT77JU2
Search engines rank web pages according to different conditions. Some of them use publication time, some use last time of update, some checks the currency of the content of the web page. In this paper, a new algorithm is proposed which will work on the time of the web page, temporal information of the content and forms a binary tree to rank among web pages.
Sabiha Firdaus. 2015. \u201cA Binary Tree based Approach for Time Based Page Ranking in Search Engines\u201d. Global Journal of Computer Science and Technology - H: Information & Technology GJCST-H Volume 15 (GJCST Volume 15 Issue H5): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 103
Country: Bangladesh
Subject: Global Journal of Computer Science and Technology - H: Information & Technology
Authors: Kashfia Sailunaz, Sabiha Firdaus, Ahmed Shoeb Al Hasan (PhD/Dr. count: 0)
View Count (all-time): 253
Total Views (Real + Logic): 7928
Total Downloads (simulated): 1941
Publish Date: 2015 11, Fri
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
Search engines rank web pages according to different conditions. Some of them use publication time, some use last time of update, some checks the currency of the content of the web page. In this paper, a new algorithm is proposed which will work on the time of the web page, temporal information of the content and forms a binary tree to rank among web pages.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.