Browsing by Keywords "PageRank"
Now showing items 1-8 of 8
-
Accelerating pagerank with a heterogeneous two phase CPU-FPGA algorithm
(Bilkent University, 2020-12)PageRank is a network analysis algorithm that is used to measure the importance of each vertex in a graph. Fundamentally it is a Sparse Matrix-Vector multiplication problem and suffers from the same bottlenecks, such as ... -
Incorporating the surfing behavior of web users into PageRank
(ACM, 2013-10-11)In large-scale commercial web search engines, estimating the importance of a web page is a crucial ingredient in ranking web search results. So far, to assess the importance of web pages, two different types of feedback ... -
Incorporating the surfing behavior of web users into PageRank
(Bilkent University, 2013)One of the most crucial factors that determines the effectiveness of a large-scale commercial web search engine is the ranking (i.e., order) in which web search results are presented to the end user. In modern web search ... -
Site-based partitioning and repartitioning techniques for parallel pagerank computation
(Institute of Electrical and Electronics Engineers, 2011-05)The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrix-vector multiplications where the involved web matrices grow in parallel with the growth of ... -
Spatial mutual information and PageRank-Based contrast enhancement and Quality-Aware relative contrast measure
(Institute of Electrical and Electronics Engineers Inc., 2016)This paper proposes a novel algorithm for global contrast enhancement using a new definition of spatial mutual information (SMI) of gray levels of an input image and PageRank algorithm. The gray levels are used to represent ... -
Steady-state analysis of Google-like stochastic matrices
(Bilkent University, 2007)Many search engines use a two-step process to retrieve from the web pages related to a user’s query. In the first step, traditional text processing is performed to find all pages matching the given query terms. Due to ... -
Steady-state analysis of google-like stochastic matrices with block iterative methods
(Kent State University, 2011)A Google-like matrix is a positive stochastic matrix given by a convex combination of a sparse, nonnegative matrix and a particular rank one matrix. Google itself uses the steady-state vector of a large matrix of this form ... -
Web-site-based partitioning techniques for efficient parallelization of the PageRank computation
(Bilkent University, 2006)Web search engines use ranking techniques to order Web pages in query results. PageRank is an important technique, which orders Web pages according to the linkage structure of the Web. The efficiency of the PageRank ...
