1
by Richard Beigel, Egemen Tanin
http://www.eecs.uic.edu/~beigel/papers/bt-qp-latin.PS.gz
Add To MetaCart
Abstract:
Abstract. We present a geometric counting problem that arises in browsing and solve it in constant time per query using nonexhaustive tables. On the other hand, we prove that several closely related problems require exhaustive tables, no matter how much time we allow per query. 1

