5344 search results - page 171 / 1069 » Privacy-Preserving Set Operations |
141
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
123
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
129
Voted
ECSQARU
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
140
click to vote
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
141
click to vote
MPC
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...