705 search results - page 37 / 141 » Approximating Extended Answer Sets |
EUROCRYPT
2004
Springer
15 years 1 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
SISAP
2008
IEEE
15 years 4 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
148
click to vote
VLDB
2001
ACM
15 years 10 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
CIKM
2003
Springer
15 years 3 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
We propose a method to evaluate queries using a last-resort semantic cache in a distributed Web search engine. The cache stores a group of frequent queries and for each of these qu...