439 search results - page 46 / 88 » Unnesting Arbitrary Queries |
SIGMOD
2004
ACM
14 years 10 months ago
2004
ACM
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an or...
PODS
1997
ACM
14 years 2 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
ECCV
2004
Springer
14 years 11 months ago
2004
Springer
We propose a method for measuring the quality of a grouping result, based on the following observation: a better grouping result provides more information about the true, unknown g...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...