Skip to main content

1 Result(s)

within Algorithm Analysis and Problem Complexity Remove this filter Data Mining and Knowledge Discovery Remove this filter Sreenivas Gollapudi Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms

    This paper describes a technique for reducing the query-time cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of its immediate neighborhood (which is a...

    Sreenivas Gollapudi, Marc Najork, Rina Panigrahy in Algorithms and Models for the Web-Graph (2007)