Browsing by Subject "K-d trees"
Now showing items 1-1 of 1
Restricted access - publisher's policyWe obtain an explicit formula for the expected cost of a fixed partial match query in a random relaxed K-d tree, that is, the expected cost for a query of the form q = (q0 , q1 , . . . , qK-1 ) with 0 < s < K specified ...