Sciweavers

1066 search results - page 5 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
PODS
2005
ACM
118views Database» more  PODS 2005»
15 years 9 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
ICASSP
2011
IEEE
14 years 1 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...
WDAG
2010
Springer
204views Algorithms» more  WDAG 2010»
14 years 8 months ago
The Cost of Privatization
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
Hagit Attiya, Eshcar Hillel
ENTCS
2008
102views more  ENTCS 2008»
14 years 9 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ICALP
2007
Springer
15 years 3 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...