Conference Proceedings
The geometry of browsing
R Beigel, E Tanin
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics | Published : 1998
DOI: 10.1007/bfb0054333
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.