Raghavan, Prabhakar
Overview
Works:  46 works in 132 publications in 4 languages and 1,735 library holdings 

Genres:  Conference proceedings 
Roles:  Author, Editor, Thesis advisor 
Classifications:  QA274, 004.015192 
Publication Timeline
.
Most widely held works by
Prabhakar Raghavan
Randomized algorithms
by
Rajeev Motwani(
Book
)
32 editions published between 1993 and 2007 in English and held by 847 WorldCat member libraries worldwide
Presents basic tools from probability theory used in algorithmic applications, with concrete examples
32 editions published between 1993 and 2007 in English and held by 847 WorldCat member libraries worldwide
Presents basic tools from probability theory used in algorithmic applications, with concrete examples
Introduction to information retrieval
by
Christopher D Manning(
Book
)
37 editions published between 2008 and 2012 in 3 languages and held by 728 WorldCat member libraries worldwide
"Classtested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an uptodate treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures."  Publisher's description
37 editions published between 2008 and 2012 in 3 languages and held by 728 WorldCat member libraries worldwide
"Classtested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an uptodate treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures."  Publisher's description
Algorithms and Computation 4th International Symposium, ISAAC '93, Hong Kong, December 1517, 1993. Proceedings
by
K. W Ng(
)
3 editions published in 1993 in English and Italian and held by 47 WorldCat member libraries worldwide
This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include:  automata, languages, and computability,  combinatorial, graph, geometric, and randomized algorithms,  networks and distributed algorithms,  VLSIand parallel algorithms,  theory of learning and robotics,  number theory and robotics. Three invited papers are also included
3 editions published in 1993 in English and Italian and held by 47 WorldCat member libraries worldwide
This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include:  automata, languages, and computability,  combinatorial, graph, geometric, and randomized algorithms,  networks and distributed algorithms,  VLSIand parallel algorithms,  theory of learning and robotics,  number theory and robotics. Three invited papers are also included
Dynamic schemes for speculative execution of code
by
Prabhakar Raghavan(
Book
)
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "Speculative execution of code is becoming a key technique for enhancing the performance of pipeline processors. In this work we study schemes that predict the execution path of a program based on the history of branch executions. Building on previous work, we present a model for analyzing the effective speedup from pipelining using various schemes for speculative execution. We follow this with stochastic analyses of various speculative execution schemes. Finally, we conclude with simulations covering several of the settings we study."
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "Speculative execution of code is becoming a key technique for enhancing the performance of pipeline processors. In this work we study schemes that predict the execution path of a program based on the history of branch executions. Building on previous work, we present a model for analyzing the effective speedup from pipelining using various schemes for speculative execution. We follow this with stochastic analyses of various speculative execution schemes. Finally, we conclude with simulations covering several of the settings we study."
Approximation schemes for the kmedians and related problems
by
Sanjeev Arora(
Book
)
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that for any c> 0 produces a solution of cost at most 1+1/c times the optimum and runs in time O(n[superscript O(c+1)]). The approximation scheme also generalizes to some problems related to kmedian. Our methodology is to extend Arora's [1, 2] techniques for TSP, which hitherto seemed inapplicable to problems such as the kmedian problem."
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that for any c> 0 produces a solution of cost at most 1+1/c times the optimum and runs in time O(n[superscript O(c+1)]). The approximation scheme also generalizes to some problems related to kmedian. Our methodology is to extend Arora's [1, 2] techniques for TSP, which hitherto seemed inapplicable to problems such as the kmedian problem."
Segmentation problems
by
Jon Kleinberg(
Book
)
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We introduce and study a novel genre of optimization problems, which we call segmentation problems. Our motivation, in part, is the development of a framework for evaluating certain data mining and clustering operations in terms of their utility in decisionmaking. For any classical optimization problem, the corresponding segmentation problem seeks to partition a set of cost vectors into several segments, so that the overall cost is optimized. This framework contains a number of standard combinatorial clustering problems as special cases, and many segmentation problems turn out to be MAXSNPcomplete even when the corresponding 'unsegmented' version is easy to solve. We develop approximation algorithms for two natural and interesting problems in this class  the hypercube segmentation problem and the catalog segmentation problem  and present a general greedy scheme, which can be specialized to approximate a large class of segmentation problems. Finally, we indicate some connections to local search, game theory, and sensitivity analysis in linear programming."
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We introduce and study a novel genre of optimization problems, which we call segmentation problems. Our motivation, in part, is the development of a framework for evaluating certain data mining and clustering operations in terms of their utility in decisionmaking. For any classical optimization problem, the corresponding segmentation problem seeks to partition a set of cost vectors into several segments, so that the overall cost is optimized. This framework contains a number of standard combinatorial clustering problems as special cases, and many segmentation problems turn out to be MAXSNPcomplete even when the corresponding 'unsegmented' version is easy to solve. We develop approximation algorithms for two natural and interesting problems in this class  the hypercube segmentation problem and the catalog segmentation problem  and present a general greedy scheme, which can be specialized to approximate a large class of segmentation problems. Finally, we indicate some connections to local search, game theory, and sensitivity analysis in linear programming."
Deferred data structuring
by
Richard M Karp(
Book
)
2 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
We develop the notion of deferred data structures by solving the problem of answering membership queries on an ordered set. We obtain a randomized algorithm which achieves asymptotically optimal performance with high probability. We then present optimal deferred data structures for the following problems in the plane: testing convex hull membership, halfplane intersection queries and fixed constraint multiobjective linear programming. We also apply the deferred data structuring technique to multidimensional dominance query problems
2 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
We develop the notion of deferred data structures by solving the problem of answering membership queries on an ordered set. We obtain a randomized algorithm which achieves asymptotically optimal performance with high probability. We then present optimal deferred data structures for the following problems in the plane: testing convex hull membership, halfplane intersection queries and fixed constraint multiobjective linear programming. We also apply the deferred data structuring technique to multidimensional dominance query problems
Proceedings
by
1995, Milwaukee, Wis.) Symposium on Foundations of Computer Science (36(
Book
)
1 edition published in 1995 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 6 WorldCat member libraries worldwide
On estimating the performance of VLSI circuits
by
Clark D Thompson(
Book
)
2 editions published in 1983 in English and held by 5 WorldCat member libraries worldwide
Metrics of energy, area, and time are defined for a graphtheoretic model of VLSI computation. A number of "technological constant factors" are introduced in order to take into account the effects of using different technologies for implementing logic circuits. Different constant factors are seen to be appropriate for different logic families. We examine seven such families: NMOS, CMOS, CMOSSOS, IsquaredL, GaAs HEMT, JjCIL, and JjCS
2 editions published in 1983 in English and held by 5 WorldCat member libraries worldwide
Metrics of energy, area, and time are defined for a graphtheoretic model of VLSI computation. A number of "technological constant factors" are introduced in order to take into account the effects of using different technologies for implementing logic circuits. Different constant factors are seen to be appropriate for different logic families. We examine seven such families: NMOS, CMOS, CMOSSOS, IsquaredL, GaAs HEMT, JjCIL, and JjCS
Randomized routing in gatearrays : y Prabhakar Raghavan and Clark D. Thompson
by
Prabhakar Raghavan(
Book
)
2 editions published in 1984 in Undetermined and English and held by 5 WorldCat member libraries worldwide
2 editions published in 1984 in Undetermined and English and held by 5 WorldCat member libraries worldwide
Randomized rounding : a technique for provably good algorithms and algorithmic proofs
by
Prabhakar Raghavan(
Book
)
2 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
We study the relation between a class of 01 integer linear programs and their rational relaxations. We show that the rational optimum to a problem instance can be used to construct a provably good 01 solution by means of a randomized algorithm. Our technique can be extended to provide bounds on the disparity between the rational and 01 optima for a given problem instance
2 editions published in 1985 in English and held by 5 WorldCat member libraries worldwide
We study the relation between a class of 01 integer linear programs and their rational relaxations. We show that the rational optimum to a problem instance can be used to construct a provably good 01 solution by means of a randomized algorithm. Our technique can be extended to provide bounds on the disparity between the rational and 01 optima for a given problem instance
Intro to Information Retrieval
(
)
1 edition published in 2008 in English and held by 4 WorldCat member libraries worldwide
Classtested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an uptodate treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures
1 edition published in 2008 in English and held by 4 WorldCat member libraries worldwide
Classtested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an uptodate treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures
Lecture notes on randomized algorithms
by
Prabhakar Raghavan(
Book
)
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Randomized rounding and discrete hamsandwich theorems : provably good algorithms for routing and packing problems
by
Prabhakar Raghavan(
Book
)
1 edition published in 1986 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1986 in English and held by 4 WorldCat member libraries worldwide
Memory versus randomization in online algorithms
by
Prabhakar Raghavan(
Book
)
2 editions published between 1988 and 1990 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Online algorithms service a sequence of requests one at a time, without knowing future requests. Their performance is compared with the performance of an offline algorithm (that sees the entire sequence) on the same sequence. In many settings, online algorithms perform almost as well as an optimal offline algorithm by using statistics about previous requests in the sequence to service references. Given that remembering such information could be expensive, we consider the use of randomization to eliminate memory. In the process, we develop and study performance measures for randomized online algorithms. We develop and analyze memoryless randomized online algorithms for the caching problem and its generalizations."
2 editions published between 1988 and 1990 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Online algorithms service a sequence of requests one at a time, without knowing future requests. Their performance is compared with the performance of an offline algorithm (that sees the entire sequence) on the same sequence. In many settings, online algorithms perform almost as well as an optimal offline algorithm by using statistics about previous requests in the sequence to service references. Given that remembering such information could be expensive, we consider the use of randomization to eliminate memory. In the process, we develop and study performance measures for randomized online algorithms. We develop and analyze memoryless randomized online algorithms for the caching problem and its generalizations."
Online algorithms
(
Book
)
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Inferring Web communities from link topologies
by David Gibson(
Book
)
2 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide
Abstract: "The World Wide Web grows through a decentralized, almost anarchic process, and this has resulted in a large hyperlinked corpus without the kind of logical organization that can be built into more traditionalllycreated [sic] hypermedia. To extract meaningful structure under such circumstances, we develop a notion of hyperlinked communities on the WWW through an analysis of the link topology. By invoking a simple, mathematically clean method for defining and exposing the structure of these communities, we are able to derive a number of themes: The communities can be viewed as containing a core of central, 'authoritative' pages linked together by 'hub pages'; and they exhibit a natural type of hierarchical topic generalization that can be inferred directly from the pattern of linkage. Our investigation shows that although the process by which users of the Web create pages and links is very difficult to understand at a 'local' level, it results in a much greater degree of orderly highlevel structure than has typically been assumed."
2 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide
Abstract: "The World Wide Web grows through a decentralized, almost anarchic process, and this has resulted in a large hyperlinked corpus without the kind of logical organization that can be built into more traditionalllycreated [sic] hypermedia. To extract meaningful structure under such circumstances, we develop a notion of hyperlinked communities on the WWW through an analysis of the link topology. By invoking a simple, mathematically clean method for defining and exposing the structure of these communities, we are able to derive a number of themes: The communities can be viewed as containing a core of central, 'authoritative' pages linked together by 'hub pages'; and they exhibit a natural type of hierarchical topic generalization that can be inferred directly from the pattern of linkage. Our investigation shows that although the process by which users of the Web create pages and links is very difficult to understand at a 'local' level, it results in a much greater degree of orderly highlevel structure than has typically been assumed."
Stochastic contention resolution with short delays
by
Prabhakar Raghavan(
Book
)
2 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We study contention resolution protocols under a stochastic model of continuous request generation from a set of contenders. The performance of such a protocol is characterized by two parameters: the maximum arrival rate for which the protocol is stable and the expected delay of a request from arrival to service. Known solutions are either unstable for any constant injection rate, or have polynomial (in the number of contenders) expected delay. Our main contribution is a protocol that is stable for a constant injection rate, while achieving logarithmic expected delay. We extend our results to the case of multiple servers, with each request being targeted for a specific server. This is related to the optically connected parallel computer (or OCPC) model. Finally, we prove a lower bound showing that long delays are inevitable in a class of protocols including backoffstyle protocols, if the arrival rate is large enough (but still smaller than 1)."
2 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We study contention resolution protocols under a stochastic model of continuous request generation from a set of contenders. The performance of such a protocol is characterized by two parameters: the maximum arrival rate for which the protocol is stable and the expected delay of a request from arrival to service. Known solutions are either unstable for any constant injection rate, or have polynomial (in the number of contenders) expected delay. Our main contribution is a protocol that is stable for a constant injection rate, while achieving logarithmic expected delay. We extend our results to the case of multiple servers, with each request being targeted for a specific server. This is related to the optically connected parallel computer (or OCPC) model. Finally, we prove a lower bound showing that long delays are inevitable in a class of protocols including backoffstyle protocols, if the arrival rate is large enough (but still smaller than 1)."
A theory of wormhole routing in parallel computers
by Sergio Felperin(
Book
)
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Virtually all theoretical work on message routing in parallel computers has dwelt on packet routing: messages are conveyed as packets, an entire packet can reside at a node of the network, and a packet is sent from the queue of one node to the queue of another node until it reaches its destination. A trend in multicomputer architecture, however, is to use wormhole routing. In wormhole routing a message is transmitted as a contiguous stream of bits, physically occupying a sequence of nodes/edges in the network. Thus, a message resembles a worm burrowing through the network. In this paper we give theoretical analyses of simple wormhole routing algorithms, showing them to be nearly optimal for butterfly and mesh connected networks. Our analysis requires initial random delays in injecting messages to the network
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Virtually all theoretical work on message routing in parallel computers has dwelt on packet routing: messages are conveyed as packets, an entire packet can reside at a node of the network, and a packet is sent from the queue of one node to the queue of another node until it reaches its destination. A trend in multicomputer architecture, however, is to use wormhole routing. In wormhole routing a message is transmitted as a contiguous stream of bits, physically occupying a sequence of nodes/edges in the network. Thus, a message resembles a worm burrowing through the network. In this paper we give theoretical analyses of simple wormhole routing algorithms, showing them to be nearly optimal for butterfly and mesh connected networks. Our analysis requires initial random delays in injecting messages to the network
Inferring Web communities from links topologies
by David Gibson(
Book
)
1 edition published in 1998 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1998 in English and held by 3 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Motwani, Rajeev Author
 Manning, Christopher D. Author
 Schütze, Hinrich
 Balasubramanian, N. V.
 Chin, Francis Y. L.
 Ng, Kam W. Author
 Thompson, Clark D. Author
 Kleinberg, Jon Author
 Gibson, David Author
 Upfal, Eli
Associated Subjects
Algorithms Cache memory Combinatorial analysis Combinatorial optimization Computer algorithms Computer architecture Computer graphics Computer network protocols Computer organization Computer science Computer storage devices Database searching Data structures (Computer science) Distribution (Probability theory) Document clustering Gate array circuits Hypertext systems Information organization Information retrieval Information storage and retrieval systems Integrated circuitsDesign and construction Integrated circuitsVery large scale integration Interactive multimedia Library science Microprocessors Multimedia systems Numerical calculationsData processing Online data processing Programming (Mathematics) Random polynomials Relaxation methods (Mathematics) Search theory Semantic Web Set theory Statistics Stochastic analysis Stochastic processesData processing Text processing (Computer science) Traveling salesman problem World Wide Web