172 search results - page 16 / 35 » On the cost of searching signature trees |
145
click to vote
GFKL
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
153
click to vote
JEA
2008
15 years 6 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
177
click to vote
ACIVS
2008
Springer
15 years 8 months ago
2008
Springer
Content-Based Image Retrieval is a challenging problem both in terms of effectiveness and efficiency. In this paper, we present a flexible cluster-and-search approach that is able ...
141
click to vote
AINA
2005
IEEE
15 years 11 months ago
2005
IEEE
Ternary content addressable (TCAM) is favorable for high-speed search due to its parallel architecture and ability for searching arbitrary-length keys. However, the usage of TCAM ...
160
Voted
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...