Ben Shneiderman
Donald Byrd
W. Bruce Croft
- 1 Croft, W., Cook, R., and Wilder, D. Providing government information on the Internet: Experiences with THOMAS. In Proceedings of Digital Libraries '95 (Austin, June 11-13), ACM Press, New York, 1995, pp. 19-24.Google Scholar
- 2 Doan, K., Plaisant, C., and Shneiderman, B. Query previews for networked information systems. In Proceedings of the 3d Forum on Research and Technology Advances in Digital Libraries (ADL) '96 (Washington, D.C., May 13-15), IEEE Computer Science Press, Los Alamitos, Calif., 1996, pp. 120-129. Google ScholarDigital Library
- 3 Hemmje, M., Kunkel, C., and Willett, A. LyberWorld--A visualization user interface supporting full-text retrieval. In Proceedings of the 17th Annual International Conference on Research and Development in Information Retrieval (SIGIR'94) (Dublin, July 3-6), W. Croft and C. van Rijsbergen, Eds. Springer-Verlag, London, 1994, pp. 249-257. Google ScholarDigital Library
- 4 Koenemann, J., and Belkin, N. A case for interaction: A study of interactive information retrieval behavior and effectiveness. In Proceedings of CHI '96, Human Factors in Computing Systems (Vancouver, B.C., Apr. 13-18), ACM Press, New York, 1996, pp. 205-212. Google Scholar
- 5 Oliver, S., and Berkebile, D. The Sm#hsonian Collection of Automobiles and Motorcycles. Smithsonian Institution Press, Washington, D.C., 1968.Google Scholar
- 6 Rao, R., Pedersen, J., Hearst, M., Mackinlay, J., Card, S., Masinter, L., Halvorsen, P.-K., and Robertson, G. Rich interaction in the digital library. Commun. ACk4 38, 4 (Apr. 1995), 29-39. Google ScholarDigital Library
- 7 Shneiderman, B. Dynamic queries for visual information seeking. IEEE Software 11, 6 (Nov.-Dec. 1994), 70-77. Google ScholarDigital Library
- 8 Somerson, Paul. Web coma. PC Comput. (Aug. 1996), 57.Google Scholar
Index Terms
- Sorting out searching: a user-interface framework for text searches
Recommendations
Spatial sorting
Many graphics and also non-graphics applications need efficient techniques to find the nearest neighbors of a given query point. There are two approaches to address this problem: space-partitioning and data-partitioning. We present a data-partitioning ...
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 ...
Comments