Efficient text searching
- Author:
- R. L. Baeza-Yates
Abstract
No abstract available.
Cited By
- Baeza-Yates R and Salinger A Fast intersection algorithms for sorted sequences Algorithms and Applications, (45-61)
- Baeza-Yates R and Salinger A Experimental analysis of a fast intersection algorithm for sorted sequences Proceedings of the 12th international conference on String Processing and Information Retrieval, (13-24)
- Demaine E, López-Ortiz A and Munro J Adaptive set intersections, unions, and differences Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (743-752)
Baeza-Yates R Visualization of large answers in text databases Proceedings of the workshop on Advanced visual interfaces, (101-107)- Baeza-Yates R and Gonnet G (1992). A new approach to text searching, Communications of the ACM, 35:10, (74-82), Online publication date: 1-Oct-1992.
- Ziviani N A system for efficient full-text retrieval Intelligent Text and Image Handling - Volume 2, (586-603)
- Baeza-Yates R, Gonnet G and Régnier M Analysis of Boyer-Moore-type string searching algorithms Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, (328-343)
- Baeza-Yates R (1989). Algorithms for string searching, ACM SIGIR Forum, 23:3-4, (34-58), Online publication date: 1-Apr-1989.
Index Terms
- Efficient text searching
Recommendations
Fast k-Nearest Neighbor Searching in Static Objects
The k-nearest neighbor searching is a classical problem that has been seriously studied, due to its many important applications. The paper proposes an efficient algorithm to search the k-nearest neighbors for static objects. Since locations of static ...