3020 search results - page 268 / 604 » Similarity Queries on Structured Data in Structured Overlays |
164
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...
165
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...
327
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
158
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—A text filtering system monitors a stream of incoming documents, to identify those that match the interest profiles of its users. The user interests are registered at ...
165
click to vote
ICDE
2005
IEEE
16 years 11 days ago
2005
IEEE
The trend towards outsourcing increases the number of documents stored at external service providers. This storage model, however, raises privacy and security concerns because the...