11784 search results - page 652 / 2357 » Interpolation for data structures |
189
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
178
click to vote
COMPGEOM
2001
ACM
15 years 11 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
235
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
198
click to vote
DMIN
2006
15 years 8 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
208
click to vote
FIMI
2003
15 years 8 months ago
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...