Tamir Tassa

activity

20112025

most citedSecure Mining of Association Rules in Horizontally Distributed Databases

3 citations · 6 across the 6 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

cs.DM2011

Finding All Allowed Edges in a Bipartite Graph

Tamir Tassa

We consider the problem of finding all allowed edges in a bipartite graph $G = (V, E)$ , i.e., all edges that are included in some maximum matching. We show that given any maximum matc…

cs.DB2011★ 3 cited

Secure Mining of Association Rules in Horizontally Distributed Databases

Tamir Tassa

We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton (TKDE 2004). Ou…