Sciweavers

570 search results - page 75 / 114
» Efficient retrieval of similar shapes
Sort
View
FC
2007
Springer
105views Cryptology» more  FC 2007»
13 years 11 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
14 years 9 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
PAMI
2010
147views more  PAMI 2010»
13 years 6 months ago
The Groupwise Medial Axis Transform for Fuzzy Skeletonization and Pruning
—Medial representations of shapes are useful due to their use of an object-centered coordinate system that directly captures intuitive notions of shape such as thickness, bending...
Aaron D. Ward, Ghassan Hamarneh
CIKM
2009
Springer
13 years 11 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...