Comparison of Three Web Search Algorithms
โ Scribed by Ying Bao; Zi-hu Zhu
- Book ID
- 106301174
- Publisher
- Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2006
- Tongue
- English
- Weight
- 175 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0168-9673
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract Session characteristics taken from large transaction logs of three Web search environments (academic website, public search engine, consumer health information service) are modeled using cluster analysis to determine if different session groups emerge for each environment. The analysis
Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is
## Abstract Major Web search engines, such as AltaVista, are essential tools in the quest to locate online information. This article reports research that used transaction log analysis to examine the characteristics and changes in AltaVista Web searching that occurred from 1998 to 2002. The researc
This paper treats the problem of how one can best compute the points of intersection of two planar rational curves. Three different algorithms are compared: the well known Bezier subdivision algorithm, a subdivision algorithm based on interval arithmetic, and the implicitization approach. Implementa