Skip to main content
Conference Proceedings

The geometry of browsing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1380 331-340
DOI: 10.1007/bfb0054333
31Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a geometric counting problem that arises in browsing and solve it in constant time per query using nonexhanstive tables. On the other hand, we prove that several closely related problems require exhaustive tables, no matter how much time we allow per query.

Cite

CITATION STYLE

APA

Beigel, R., & Tanin, E. (1998). The geometry of browsing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1380, pp. 331–340). Springer Verlag. https://doi.org/10.1007/bfb0054333

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free