Class-tested and up-to-date textbook for introductory courses on information retrieval.

For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.

Class-tested and up-to-date textbook for introductory courses on information retrieval.

This thesis deals wiht the approximate solution of a class of zer0-one integer programs arising in the design of integrated circuits, in operations research, and in some combinatorial problems. Our approach consists of first relaxing the integer program to a linear program, which can be solved by efficient algorithms. The linear program solution may assign fractional values to some of the variables, and these values are 'rounded' to obtain a provably good approximation to the original integer program.

情報検索の基礎を扱った網羅的で最先端の入門書

01 Boolean 검색 02 용어 어휘집과 포스팅 목록 03 사전과 융통성 있는 검색 04 색인 구축 05 색인 압축 06 점수 계산, 용어 가중치, 백터 공간 모델 07 완전한 검색 시스템에서의 점수 계산 08 정보 검색 평가 09 적합성 피드백과 질의 확장 10 XML 검색 11 확률 정보 검색 12 정보 검색을 위한 언어 모델 13 문서 분류와 Naive Bayes 14 벡터 공간 분류 15 지지 벡터 기계와 기계 학습 16 평균 군집화 17 계층 군집화 18 행렬 분해와 잠재 의미 색인 19 웹 검색의 기초 20 웹 수집과 색인 21 링크 분석

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."