5344 search results - page 412 / 1069 » Privacy-Preserving Set Operations |
173
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
228
Voted
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
146
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
277
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
148
click to vote
OSDI
2002
ACM
16 years 5 months ago
2002
ACM
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...