3020 search results - page 370 / 604 » Similarity Queries on Structured Data in Structured Overlays |
198
click to vote
EDBT
2009
ACM
15 years 12 months ago
2009
ACM
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
186
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
205
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
203
click to vote
COMGEO
2004
ACM
15 years 7 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
325
click to vote
FCCM
2011
IEEE
14 years 11 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...