11394 search results - page 573 / 2279 » Error-Correcting Data Structures |
177
click to vote
COMPGEOM
2001
ACM
15 years 10 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...
232
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...
197
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 ...
176
click to vote
ALENEX
2003
15 years 8 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
206
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...