418 search results - page 63 / 84 » Many Happy Returns |
70
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
175
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
164
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a ...
116
click to vote
EDBT
2002
ACM
15 years 9 months ago
2002
ACM
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...