137 search results - page 19 / 28 » Efficient Tree Search in Encrypted Data |
100
click to vote
BTW
2005
Springer
15 years 5 months ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
CRYPTO
2010
Springer
15 years 22 days ago
2010
Springer
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
100
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
195
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
106
click to vote
EDBT
2006
ACM
15 years 11 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...