2498 search results - page 173 / 500 » Data Structures with Unpredictable Timing |
132
Voted
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
COMPGEOM
1994
ACM
15 years 2 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...
FIMI
2003
14 years 11 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...
ALENEX
2003
14 years 11 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...
104
click to vote
SEMWEB
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Wikis allow users to collaboratively create and maintain content. Semantic wikis, which provide the additional means to annotate the content semantically and thereby allo...