Skip to main content

2 Result(s)

within Sreenivas Gollapudi Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Discrete Mathematics in Computer Science Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Ad Allocation for Browse Sessions

    A user’s session of information need often goes well beyond his search query and first click on the search result page and therefore is characterized by both search and browse activities on the web. In such se...

    Anand Bhalgat, Sreenivas Gollapudi in Internet and Network Economics (2012)

  2. 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)